L1
Proposition. (MetaCatSet_coequalizer_gen)
∀Obj : set → prop, (∀X, Obj X → ∀Q ⊆ X, Obj Q) → ∃quot : set → set → set → set → set, ∃canonmap : set → set → set → set → set, ∃fac : set → set → set → set → set → set → set, coequalizer_constr_p Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) quot canonmap fac
Proof:
Proof not loaded.
L12
Proposition. (MetaCatSet_coequalizer)
∃quot : set → set → set → set → set, ∃canonmap : set → set → set → set → set, ∃fac : set → set → set → set → set → set → set, coequalizer_constr_p (λ_ ⇒ True) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) quot canonmap fac
Proof:
Proof not loaded.
L21
Proposition. (MetaCatHFSet_coequalizer)
∃quot : set → set → set → set → set, ∃canonmap : set → set → set → set → set, ∃fac : set → set → set → set → set → set → set, coequalizer_constr_p (λX ⇒ X ∈ UnivOf Empty) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) quot canonmap fac
Proof:
Proof not loaded.
L30
Proposition. (MetaCatSmallSet_coequalizer)
∃quot : set → set → set → set → set, ∃canonmap : set → set → set → set → set, ∃fac : set → set → set → set → set → set → set, coequalizer_constr_p (λX ⇒ X ∈ UnivOf (UnivOf Empty)) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) quot canonmap fac
Proof:
Proof not loaded.
L39
Proposition. (MetaCatSet_equalizer_gen)
∀Obj : set → prop, (∀X, Obj X → ∀Q ⊆ X, Obj Q) → ∃quot : set → set → set → set → set, ∃canonmap : set → set → set → set → set, ∃fac : set → set → set → set → set → set → set, equalizer_constr_p Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) quot canonmap fac
Proof:
Proof not loaded.
L50
Proposition. (MetaCatHFSet_equalizer_gen)
∀Obj : set → prop, (∀X, Obj X → ∀Q ⊆ X, Obj Q) → ∃quot : set → set → set → set → set, ∃canonmap : set → set → set → set → set, ∃fac : set → set → set → set → set → set → set, equalizer_constr_p (λX ⇒ X ∈ UnivOf Empty) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) quot canonmap fac
Proof:
Proof not loaded.
L61
Proposition. (MetaCatSmallSet_equalizer_gen)
∀Obj : set → prop, (∀X, Obj X → ∀Q ⊆ X, Obj Q) → ∃quot : set → set → set → set → set, ∃canonmap : set → set → set → set → set, ∃fac : set → set → set → set → set → set → set, equalizer_constr_p (λX ⇒ X ∈ UnivOf (UnivOf Empty)) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) quot canonmap fac
Proof:
Proof not loaded.
L72
Proposition. (MetaCatSet_pullback_gen)
∀Obj : set → prop, MetaCat Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) → (∀X, Obj X → ∀Q ⊆ X, Obj Q) → (∀X, Obj X → ∀Y, Obj Y → Obj (setprod X Y)) → ∃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 Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) pb pi0 pi1 pair
Proof:
Proof not loaded.
L88
Proposition. (MetaCatSet_pullback)
∃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 (λ_ ⇒ True) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) pb pi0 pi1 pair
Proof:
Proof not loaded.
L98
Proposition. (MetaCatHFSet_pullback)
∃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 (λX ⇒ X ∈ UnivOf Empty) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) pb pi0 pi1 pair
Proof:
Proof not loaded.
L108
Proposition. (MetaCatSmallSet_pullback)
∃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 (λX ⇒ X ∈ UnivOf (UnivOf Empty)) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) pb pi0 pi1 pair
Proof:
Proof not loaded.
L118
Proposition. (MetaCatSet_pushout_gen)
∀Obj : set → prop, MetaCat Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) → (∀X, Obj X → ∀Q ⊆ X, Obj Q) → (∀X, Obj X → ∀Y, Obj Y → Obj (setsum X Y)) → ∃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 Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) po i0 i1 copair
Proof:
Proof not loaded.
L134
Proposition. (MetaCatSet_pushout)
∃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 (λ_ ⇒ True) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) po i0 i1 copair
Proof:
Proof not loaded.
L144
Proposition. (MetaCatHFSet_pushout)
∃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 (λX ⇒ X ∈ UnivOf Empty) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) po i0 i1 copair
Proof:
Proof not loaded.
L154
Proposition. (MetaCatSmallSet_pushout)
∃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 (λX ⇒ X ∈ UnivOf (UnivOf Empty)) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) po i0 i1 copair
Proof:
Proof not loaded.
L164
Proposition. (MetaCatSet_product_exponent_gen_setprod_setexp)
∀Obj : set → prop, (∀X, Obj X → ∀Y, Obj Y → Obj (setprod X Y)) → (∀X, Obj X → ∀Y, Obj Y → Obj (YX)) → product_exponent_constr_p Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) setprod (λX Y ⇒ (λz ∈ X ⨯ Y ⇒ z 0)) (λX Y ⇒ (λz ∈ X ⨯ Y ⇒ z 1)) (λX Y W h k ⇒ (λw ∈ W ⇒ (h w,k w))) (λX Y ⇒ YX) (λX Y ⇒ (λfx ∈ (YX) ⨯ X ⇒ fx 0 (fx 1))) (λX Y W f ⇒ (λw ∈ W ⇒ λx ∈ X ⇒ f (w,x)))
Proof:
Proof not loaded.
L180
Proposition. (MetaCatSet_product_exponent_gen)
∀Obj : set → prop, (∀X, Obj X → ∀Y, Obj Y → Obj (setprod X Y)) → (∀X, Obj X → ∀Y, Obj Y → Obj (YX)) → ∃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 Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) prod pi0 pi1 pair exp a lm
Proof:
Proof not loaded.
L196
Proposition. (MetaCatSet_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 (λ_ ⇒ True) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) prod pi0 pi1 pair exp a lm
Proof:
Proof not loaded.
L207
Proposition. (MetaCatHFSet_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 (λX ⇒ X ∈ UnivOf Empty) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) prod pi0 pi1 pair exp a lm
Proof:
Proof not loaded.
L218
Proposition. (MetaCatSet_monic_inj_gen)
∀Obj : set → prop, ∀X Y, ∀f : set, monic Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) X Y f → ∀u v ∈ X, f u = f v → u = v
Proof:
Proof not loaded.
L225
Proposition. (MetaCatSet_subobject_classifier_gen)
∀Obj : set → prop, Obj 1 → Obj 2 → subobject_classifier_p Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) 1 (λX : set ⇒ (λx ∈ X ⇒ 0)) 2 (λ_ ∈ 1 ⇒ 1) (λX Y : set ⇒ λm : set ⇒ (λy ∈ Y ⇒ if (∃x ∈ X, m x = y) then 1 else 0)) (λX Y : set ⇒ λm : set ⇒ λW : set ⇒ λh k : set ⇒ (λw ∈ W ⇒ inv X (λx ⇒ m x) (k w)))
Proof:
Proof not loaded.
L235
Proposition. (MetaCatSet_subobject_classifier_gen_ex)
∀Obj : set → prop, Obj 1 → Obj 2 → ∃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 Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) one uniqa Omega tru ch constr
Proof:
Proof not loaded.
L247
Proposition. (MetaCatSet_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 (λ_ ⇒ True) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) one uniqa Omega tru ch constr
Proof:
Proof not loaded.
L257
Proposition. (MetaCatHFSet_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 (λX ⇒ X ∈ UnivOf Empty) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) one uniqa Omega tru ch constr
Proof:
Proof not loaded.
L267
Proposition. (MetaCatSmallSet_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 (λX ⇒ X ∈ UnivOf (UnivOf Empty)) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) one uniqa Omega tru ch constr
Proof:
Proof not loaded.
L277
Proposition. (MetaCatSet_nno_gen)
∀Obj : set → prop, Obj 1 → Obj omega → nno_p Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) 1 (λX : set ⇒ (λx ∈ X ⇒ 0)) omega (λ_ ∈ 1 ⇒ 0) (λn ∈ omega ⇒ ordsucc n) (λX : set ⇒ λx f : set ⇒ (λn ∈ omega ⇒ nat_primrec (x 0) (λ_ v ⇒ f v) n))
Proof:
Proof not loaded.
L286
Proposition. (MetaCatSet_nno_gen_ex)
∀Obj : set → prop, Obj 1 → Obj omega → ∃one : set, ∃uniqa : set → set, ∃N : set, ∃zer suc : set, ∃rec : set → set → set → set, nno_p Obj SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) one uniqa N zer suc rec
Proof:
Proof not loaded.
L299
Proposition. (MetaCatSet_nno)
∃one : set, ∃uniqa : set → set, ∃N : set, ∃zer suc : set, ∃rec : set → set → set → set, nno_p (λ_ ⇒ True) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) one uniqa N zer suc rec
Proof:
Proof not loaded.
L310
Proposition. (MetaCatSmallSet_nno)
∃one : set, ∃uniqa : set → set, ∃N : set, ∃zer suc : set, ∃rec : set → set → set → set, nno_p (λX ⇒ X ∈ UnivOf (UnivOf Empty)) SetHom (λX ⇒ lam_id X) (λX Y Z f g ⇒ lam_comp X f g) one uniqa N zer suc rec
Proof:
Proof not loaded.