Database
ZF (ZERMELO-FRAENKEL) SET THEORY
ZF Set Theory - add the Axiom of Union
"Strong" transfinite recursion
recseq
Next ⟩
nfrecs
Metamath Proof Explorer
Ascii
Unicode
Theorem
recseq
Description:
Equality theorem for
recs
.
(Contributed by
Stefan O'Rear
, 18-Jan-2015)
Ref
Expression
Assertion
recseq
⊢
F
=
G
→
recs
⁡
F
=
recs
⁡
G
Proof
Step
Hyp
Ref
Expression
1
wrecseq3
⊢
F
=
G
→
wrecs
⁡
E
On
F
=
wrecs
⁡
E
On
G
2
df-recs
⊢
recs
⁡
F
=
wrecs
⁡
E
On
F
3
df-recs
⊢
recs
⁡
G
=
wrecs
⁡
E
On
G
4
1
2
3
3eqtr4g
⊢
F
=
G
→
recs
⁡
F
=
recs
⁡
G