Definition. We define struct_r_partialord to be λX ⇒ struct_r X ∧ unpack_r_o X (λX' r ⇒ (∀x ∈ X', ¬ r x x) ∧ (∀x y z ∈ X', r x y → r y z → r x z)) of type set → prop.
In Proofgold the corresponding term root is 64673b... and object id is adb47f...
Theorem. (MetaCat_struct_r_partialord)
MetaCat struct_r_partialord Hom_struct_r struct_id struct_comp
In Proofgold the corresponding term root is 3cfb35... and proposition id is c6620b...
Proof:
We prove the intermediate claim L1: ∀X, struct_r_partialord X → struct_r X.
Let X be given.
Assume HX.
Apply HX to the current goal.
Assume H _.
An exact proof term for the current goal is H.
An exact proof term for the current goal is MetaCat_struct_r_gen struct_r_partialord L1.
∎
Theorem. (MetaCat_struct_r_partialord_Forgetful)
MetaFunctor struct_r_partialord Hom_struct_r 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)
In Proofgold the corresponding term root is 347730... and proposition id is c7aa16...
Proof:
We prove the intermediate claim L1: ∀X, struct_r_partialord X → struct_r X.
Let X be given.
Assume HX.
Apply HX to the current goal.
Assume H _.
An exact proof term for the current goal is H.
An exact proof term for the current goal is MetaCat_struct_r_Forgetful_gen struct_r_partialord L1.
∎
Proposition. (MetaCat_struct_r_partialord_initial)
∃Y : set, ∃uniqa : set → set, initial_p struct_r_partialord Hom_struct_r struct_id struct_comp Y uniqa
In Proofgold the corresponding term root is 7cfa54... and proposition id is f3af96...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_terminal)
∃Y : set, ∃uniqa : set → set, terminal_p struct_r_partialord Hom_struct_r struct_id struct_comp Y uniqa
In Proofgold the corresponding term root is 2009f5... and proposition id is 058dae...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_coproduct_constr)
∃coprod : set → set → set, ∃i0 i1 : set → set → set, ∃copair : set → set → set → set → set → set, coproduct_constr_p struct_r_partialord Hom_struct_r struct_id struct_comp coprod i0 i1 copair
In Proofgold the corresponding term root is 3f5001... and proposition id is 8a2ce9...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_product_constr)
∃prod : set → set → set, ∃pi0 pi1 : set → set → set, ∃pair : set → set → set → set → set → set, product_constr_p struct_r_partialord Hom_struct_r struct_id struct_comp prod pi0 pi1 pair
In Proofgold the corresponding term root is 7acdd2... and proposition id is 42715c...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_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_r_partialord Hom_struct_r struct_id struct_comp quot canonmap fac
In Proofgold the corresponding term root is 2c8b6e... and proposition id is e18a26...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_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_r_partialord Hom_struct_r struct_id struct_comp quot canonmap fac
In Proofgold the corresponding term root is 14b524... and proposition id is 3d0dd4...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_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_r_partialord Hom_struct_r struct_id struct_comp po i0 i1 copair
In Proofgold the corresponding term root is 099974... and proposition id is dab5c8...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_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_r_partialord Hom_struct_r struct_id struct_comp pb pi0 pi1 pair
In Proofgold the corresponding term root is de0ba5... and proposition id is d1a34e...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_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_r_partialord Hom_struct_r struct_id struct_comp prod pi0 pi1 pair exp a lm
In Proofgold the corresponding term root is ebb939... and proposition id is f1e9d8...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_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_r_partialord Hom_struct_r struct_id struct_comp one uniqa Omega tru ch constr
In Proofgold the corresponding term root is d956c5... and proposition id is 21b6c9...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_nno)
∃one : set, ∃uniqa : set → set, ∃N : set, ∃zer suc : set, ∃rec : set → set → set → set, nno_p struct_r_partialord Hom_struct_r struct_id struct_comp one uniqa N zer suc rec
In Proofgold the corresponding term root is 871a34... and proposition id is 6bf665...
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_r_partialord_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_r_partialord Hom_struct_r struct_id struct_comp F0 F1 (λX ⇒ X 0) (λX Y f ⇒ f) eta eps
In Proofgold the corresponding term root is 921e16... and proposition id is 123cf0...
Proof:
The rest of the proof is missing.