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 8037 using well-founded 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 7500 | . . 3 ⊢ E We On | |
2 | epse 5541 | . . 3 ⊢ E Se On | |
3 | tfrALT.1 | . . . 4 ⊢ 𝐹 = recs(𝐺) | |
4 | df-recs 8011 | . . . 4 ⊢ recs(𝐺) = wrecs( E , On, 𝐺) | |
5 | 3, 4 | eqtri 2847 | . . 3 ⊢ 𝐹 = wrecs( E , On, 𝐺) |
6 | 1, 2, 5 | wfr2 7977 | . 2 ⊢ (𝐴 ∈ On → (𝐹‘𝐴) = (𝐺‘(𝐹 ↾ Pred( E , On, 𝐴)))) |
7 | predon 7509 | . . . 4 ⊢ (𝐴 ∈ On → Pred( E , On, 𝐴) = 𝐴) | |
8 | 7 | reseq2d 5856 | . . 3 ⊢ (𝐴 ∈ On → (𝐹 ↾ Pred( E , On, 𝐴)) = (𝐹 ↾ 𝐴)) |
9 | 8 | fveq2d 6677 | . 2 ⊢ (𝐴 ∈ On → (𝐺‘(𝐹 ↾ Pred( E , On, 𝐴))) = (𝐺‘(𝐹 ↾ 𝐴))) |
10 | 6, 9 | eqtrd 2859 | 1 ⊢ (𝐴 ∈ On → (𝐹‘𝐴) = (𝐺‘(𝐹 ↾ 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1536 ∈ wcel 2113 E cep 5467 ↾ cres 5560 Predcpred 6150 Oncon0 6194 ‘cfv 6358 wrecscwrecs 7949 recscrecs 8010 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-se 5518 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-wrecs 7950 df-recs 8011 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |