L1
Definition. We define struct_u_inj to be λX ⇒ struct_u X ∧ unpack_u_o X (λX' h ⇒ inj X' X' (λx ⇒ h x)) of type set → prop.
(*** $I sig/PfgEJul2021Preamble7.mgs ***)
L4
Theorem. (MetaCat_struct_u_inj)
MetaCat struct_u_inj Hom_struct_u struct_id struct_comp
Proof:
Proof not loaded.
L10
Theorem. (MetaCat_struct_u_inj_Forgetful)
MetaFunctor struct_u_inj Hom_struct_u struct_id struct_comp (λ_ ⇒ True) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ (lam_comp X f g)) (λX ⇒ X 0) (λX Y f ⇒ f)
Proof:
Proof not loaded.
L20
Proposition. (MetaCat_struct_u_inj_initial)
∃Y : set, ∃uniqa : set → set, initial_p struct_u_inj Hom_struct_u struct_id struct_comp Y uniqa
Proof:
Proof not loaded.
L24
Proposition. (MetaCat_struct_u_inj_terminal)
∃Y : set, ∃uniqa : set → set, terminal_p struct_u_inj Hom_struct_u struct_id struct_comp Y uniqa
Proof:
Proof not loaded.
L28
Proposition. (MetaCat_struct_u_inj_coproduct_constr)
∃coprod : set → set → set, ∃i0 i1 : set → set → set, ∃copair : set → set → set → set → set → set, coproduct_constr_p struct_u_inj Hom_struct_u struct_id struct_comp coprod i0 i1 copair
Proof:
Proof not loaded.
L35
Proposition. (MetaCat_struct_u_inj_product_constr)
∃prod : set → set → set, ∃pi0 pi1 : set → set → set, ∃pair : set → set → set → set → set → set, product_constr_p struct_u_inj Hom_struct_u struct_id struct_comp prod pi0 pi1 pair
Proof:
Proof not loaded.
L42
Proposition. (MetaCat_struct_u_inj_coequalizer_constr)
∃quot : set → set → set → set → set, ∃canonmap : set → set → set → set → set, ∃fac : set → set → set → set → set → set → set, coequalizer_constr_p struct_u_inj Hom_struct_u struct_id struct_comp quot canonmap fac
Proof:
Proof not loaded.
L49
Proposition. (MetaCat_struct_u_inj_equalizer_constr)
∃quot : set → set → set → set → set, ∃canonmap : set → set → set → set → set, ∃fac : set → set → set → set → set → set → set, equalizer_constr_p struct_u_inj Hom_struct_u struct_id struct_comp quot canonmap fac
Proof:
Proof not loaded.
L56
Proposition. (MetaCat_struct_u_inj_pushout_constr)
∃po : set → set → set → set → set → set, ∃i0 : set → set → set → set → set → set, ∃i1 : set → set → set → set → set → set, ∃copair : set → set → set → set → set → set → set → set → set, pushout_constr_p struct_u_inj Hom_struct_u struct_id struct_comp po i0 i1 copair
Proof:
Proof not loaded.
L64
Proposition. (MetaCat_struct_u_inj_pullback_constr)
∃pb : set → set → set → set → set → set, ∃pi0 : set → set → set → set → set → set, ∃pi1 : set → set → set → set → set → set, ∃pair : set → set → set → set → set → set → set → set → set, pullback_constr_p struct_u_inj Hom_struct_u struct_id struct_comp pb pi0 pi1 pair
Proof:
Proof not loaded.
L72
Proposition. (MetaCat_struct_u_inj_product_exponent)
∃prod : set → set → set, ∃pi0 pi1 : set → set → set, ∃pair : set → set → set → set → set → set, ∃exp : set → set → set, ∃a : set → set → set, ∃lm : set → set → set → set → set, product_exponent_constr_p struct_u_inj Hom_struct_u struct_id struct_comp prod pi0 pi1 pair exp a lm
Proof:
Proof not loaded.
L82
Proposition. (MetaCat_struct_u_inj_subobject_classifier)
∃one : set, ∃uniqa : set → set, ∃Omega : set, ∃tru : set, ∃ch : set → set → set → set, ∃constr : set → set → set → set → set → set → set, subobject_classifier_p struct_u_inj Hom_struct_u struct_id struct_comp one uniqa Omega tru ch constr
Proof:
Proof not loaded.
L90
Proposition. (MetaCat_struct_u_inj_nno)
∃one : set, ∃uniqa : set → set, ∃N : set, ∃zer suc : set, ∃rec : set → set → set → set, nno_p struct_u_inj Hom_struct_u struct_id struct_comp one uniqa N zer suc rec
Proof:
Proof not loaded.
L99
Proposition. (MetaCat_struct_u_inj_left_adjoint_forgetful)
∃F0 : set → set, ∃F1 : set → set → set → set, ∃eta eps : set → set, MetaAdjunction_strict (λ_ ⇒ True) SetHom (λX ⇒ (lam_id X)) (λX Y Z f g ⇒ (lam_comp X f g)) struct_u_inj Hom_struct_u struct_id struct_comp F0 F1 (λX ⇒ X 0) (λX Y f ⇒ f) eta eps
Proof:
Proof not loaded.