Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tfr1ALT | Structured version Visualization version GIF version |
Description: Alternate proof of tfr1 8157 using well-ordered recursion. (Contributed by Scott Fenton, 3-Aug-2020.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
tfrALT.1 | ⊢ 𝐹 = recs(𝐺) |
Ref | Expression |
---|---|
tfr1ALT | ⊢ 𝐹 Fn On |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | epweon 7582 | . 2 ⊢ E We On | |
2 | epse 5552 | . 2 ⊢ E Se On | |
3 | tfrALT.1 | . . 3 ⊢ 𝐹 = recs(𝐺) | |
4 | df-recs 8132 | . . 3 ⊢ recs(𝐺) = wrecs( E , On, 𝐺) | |
5 | 3, 4 | eqtri 2767 | . 2 ⊢ 𝐹 = wrecs( E , On, 𝐺) |
6 | 1, 2, 5 | wfr1 8097 | 1 ⊢ 𝐹 Fn On |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1543 E cep 5477 Oncon0 6234 Fn wfn 6396 wrecscwrecs 8070 recscrecs 8131 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2710 ax-rep 5196 ax-sep 5209 ax-nul 5216 ax-pr 5339 ax-un 7545 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2818 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3071 df-rmo 3072 df-rab 3073 df-v 3425 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4255 df-if 4457 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5153 df-tr 5179 df-id 5472 df-eprel 5478 df-po 5486 df-so 5487 df-fr 5527 df-se 5528 df-we 5529 df-xp 5575 df-rel 5576 df-cnv 5577 df-co 5578 df-dm 5579 df-rn 5580 df-res 5581 df-ima 5582 df-pred 6179 df-ord 6237 df-on 6238 df-iota 6359 df-fun 6403 df-fn 6404 df-f 6405 df-f1 6406 df-fo 6407 df-f1o 6408 df-fv 6409 df-wrecs 8071 df-recs 8132 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |