Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tfr2ALT | Structured version Visualization version GIF version |
Description: Alternate proof of tfr2 8229 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 |
---|---|
tfr2ALT | ⊢ (𝐴 ∈ On → (𝐹‘𝐴) = (𝐺‘(𝐹 ↾ 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | epweon 7625 | . . 3 ⊢ E We On | |
2 | epse 5572 | . . 3 ⊢ E Se On | |
3 | tfrALT.1 | . . . . 5 ⊢ 𝐹 = recs(𝐺) | |
4 | df-recs 8202 | . . . . 5 ⊢ recs(𝐺) = wrecs( E , On, 𝐺) | |
5 | 3, 4 | eqtri 2766 | . . . 4 ⊢ 𝐹 = wrecs( E , On, 𝐺) |
6 | 5 | wfr2 8167 | . . 3 ⊢ ((( E We On ∧ E Se On) ∧ 𝐴 ∈ On) → (𝐹‘𝐴) = (𝐺‘(𝐹 ↾ Pred( E , On, 𝐴)))) |
7 | 1, 2, 6 | mpanl12 699 | . 2 ⊢ (𝐴 ∈ On → (𝐹‘𝐴) = (𝐺‘(𝐹 ↾ Pred( E , On, 𝐴)))) |
8 | predon 7635 | . . . 4 ⊢ (𝐴 ∈ On → Pred( E , On, 𝐴) = 𝐴) | |
9 | 8 | reseq2d 5891 | . . 3 ⊢ (𝐴 ∈ On → (𝐹 ↾ Pred( E , On, 𝐴)) = (𝐹 ↾ 𝐴)) |
10 | 9 | fveq2d 6778 | . 2 ⊢ (𝐴 ∈ On → (𝐺‘(𝐹 ↾ Pred( E , On, 𝐴))) = (𝐺‘(𝐹 ↾ 𝐴))) |
11 | 7, 10 | eqtrd 2778 | 1 ⊢ (𝐴 ∈ On → (𝐹‘𝐴) = (𝐺‘(𝐹 ↾ 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 E cep 5494 Se wse 5542 We wwe 5543 ↾ cres 5591 Predcpred 6201 Oncon0 6266 ‘cfv 6433 wrecscwrecs 8127 recscrecs 8201 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |