Definition. We define struct_b_b_e_e_semiring to be λR ⇒ struct_b_b_e_e Runpack_b_b_e_e_o R (λR plus mult zero one ⇒ (∀x y zR, plus (plus x y) z = plus x (plus y z))(∀x yR, plus x y = plus y x)(∀xR, plus x zero = x)(∀x y zR, mult (mult x y) z = mult x (mult y z))(∀xR, mult x one = xmult one x = x)(∀x y zR, mult x (plus y z) = plus (mult x y) (mult x z))(∀x y zR, mult (plus x y) z = plus (mult x z) (mult y z))(∀xR, mult x zero = zero)(∀xR, mult zero x = zero)) of type setprop.
Theorem. (MetaCat_struct_b_b_e_e_semiring)
MetaCat struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp
Proof:
We prove the intermediate claim L1: ∀X, struct_b_b_e_e_semiring Xstruct_b_b_e_e 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_b_b_e_e_gen struct_b_b_e_e_semiring L1.
Theorem. (MetaCat_struct_b_b_e_e_semiring_Forgetful)
MetaFunctor struct_b_b_e_e_semiring Hom_struct_b_b_e_e 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:
We prove the intermediate claim L1: ∀X, struct_b_b_e_e_semiring Xstruct_b_b_e_e 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_b_b_e_e_Forgetful_gen struct_b_b_e_e_semiring L1.
Proposition. (MetaCat_struct_b_b_e_e_semiring_initial)
∃Y : set, ∃uniqa : setset, initial_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp Y uniqa
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_terminal)
∃Y : set, ∃uniqa : setset, terminal_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp Y uniqa
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_coproduct_constr)
∃coprod : setsetset, ∃i0 i1 : setsetset, ∃copair : setsetsetsetsetset, coproduct_constr_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp coprod i0 i1 copair
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_product_constr)
∃prod : setsetset, ∃pi0 pi1 : setsetset, ∃pair : setsetsetsetsetset, product_constr_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp prod pi0 pi1 pair
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_coequalizer_constr)
∃quot : setsetsetsetset, ∃canonmap : setsetsetsetset, ∃fac : setsetsetsetsetsetset, coequalizer_constr_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp quot canonmap fac
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_equalizer_constr)
∃quot : setsetsetsetset, ∃canonmap : setsetsetsetset, ∃fac : setsetsetsetsetsetset, equalizer_constr_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp quot canonmap fac
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_pushout_constr)
∃po : setsetsetsetsetset, ∃i0 : setsetsetsetsetset, ∃i1 : setsetsetsetsetset, ∃copair : setsetsetsetsetsetsetsetset, pushout_constr_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp po i0 i1 copair
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_pullback_constr)
∃pb : setsetsetsetsetset, ∃pi0 : setsetsetsetsetset, ∃pi1 : setsetsetsetsetset, ∃pair : setsetsetsetsetsetsetsetset, pullback_constr_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp pb pi0 pi1 pair
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_product_exponent)
∃prod : setsetset, ∃pi0 pi1 : setsetset, ∃pair : setsetsetsetsetset, ∃exp : setsetset, ∃a : setsetset, ∃lm : setsetsetsetset, product_exponent_constr_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp prod pi0 pi1 pair exp a lm
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_subobject_classifier)
∃one : set, ∃uniqa : setset, ∃Omega : set, ∃tru : set, ∃ch : setsetsetset, ∃constr : setsetsetsetsetsetset, subobject_classifier_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp one uniqa Omega tru ch constr
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_nno)
∃one : set, ∃uniqa : setset, ∃N : set, ∃zer suc : set, ∃rec : setsetsetset, nno_p struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp one uniqa N zer suc rec
Proof:
The rest of the proof is missing.

Proposition. (MetaCat_struct_b_b_e_e_semiring_left_adjoint_forgetful)
∃F0 : setset, ∃F1 : setsetsetset, ∃eta eps : setset, MetaAdjunction_strict (λ_ ⇒ True) SetHom (λX ⇒ (lam_id X)) (λX Y Z f g ⇒ (lam_comp X f g)) struct_b_b_e_e_semiring Hom_struct_b_b_e_e struct_id struct_comp F0 F1 (λX ⇒ X 0) (λX Y f ⇒ f) eta eps
Proof:
The rest of the proof is missing.