Primitive. The name wsbc is a term of type ((set → prop) → ((set → prop) → prop)).
Primitive. The name wceq is a term of type ((set → prop) → ((set → prop) → prop)).
(*** $T setmm ***)
(*** $I sig/DefaultElts.mgs ***)
L5
Axiom. (ax_mp) We take the following as an axiom:
(∀ph : prop, (∀ps : prop, ph → (wi ph ps) → ps))
L6
Axiom. (ax_frege52c) We take the following as an axiom:
(∀ph : (set → prop), (∀A2 : (set → (set → prop)), (∀B2 : (set → (set → prop)), (∀x3 : set, (wi (wceq (A2 x3) (B2 x3)) (wi (wsbc (λx3 : set ⇒ (ph x3)) (A2 x3)) (wsbc (λx3 : set ⇒ (ph x3)) (B2 x3))))))))
L7
Axiom. (ax_frege8) We take the following as an axiom:
(∀ph : prop, (∀ps : prop, (∀ch : prop, (wi (wi ph (wi ps ch)) (wi ps (wi ph ch))))))
L8
Theorem. (frege53c)
(∀ph : (set → prop), (∀A2 : (set → (set → prop)), (∀B2 : (set → (set → prop)), (∀x3 : set, (wi (wsbc (λx3 : set ⇒ (ph x3)) (A2 x3)) (wi (wceq (A2 x3) (B2 x3)) (wsbc (λx3 : set ⇒ (ph x3)) (B2 x3))))))))
Proof:
Proof not loaded.