![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > tfr3ALT | Structured version Visualization version GIF version |
Description: Alternate proof of tfr3 8455 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 |
---|---|
tfr3ALT | ⊢ ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵‘𝑥) = (𝐺‘(𝐵 ↾ 𝑥))) → 𝐵 = 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | predon 7821 | . . . . . . 7 ⊢ (𝑥 ∈ On → Pred( E , On, 𝑥) = 𝑥) | |
2 | 1 | reseq2d 6009 | . . . . . 6 ⊢ (𝑥 ∈ On → (𝐵 ↾ Pred( E , On, 𝑥)) = (𝐵 ↾ 𝑥)) |
3 | 2 | fveq2d 6924 | . . . . 5 ⊢ (𝑥 ∈ On → (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))) = (𝐺‘(𝐵 ↾ 𝑥))) |
4 | 3 | eqeq2d 2751 | . . . 4 ⊢ (𝑥 ∈ On → ((𝐵‘𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))) ↔ (𝐵‘𝑥) = (𝐺‘(𝐵 ↾ 𝑥)))) |
5 | 4 | ralbiia 3097 | . . 3 ⊢ (∀𝑥 ∈ On (𝐵‘𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))) ↔ ∀𝑥 ∈ On (𝐵‘𝑥) = (𝐺‘(𝐵 ↾ 𝑥))) |
6 | epweon 7810 | . . . 4 ⊢ E We On | |
7 | epse 5682 | . . . 4 ⊢ E Se On | |
8 | tfrALT.1 | . . . . . 6 ⊢ 𝐹 = recs(𝐺) | |
9 | df-recs 8427 | . . . . . 6 ⊢ recs(𝐺) = wrecs( E , On, 𝐺) | |
10 | 8, 9 | eqtri 2768 | . . . . 5 ⊢ 𝐹 = wrecs( E , On, 𝐺) |
11 | 10 | wfr3 8393 | . . . 4 ⊢ ((( E We On ∧ E Se On) ∧ (𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵‘𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))))) → 𝐹 = 𝐵) |
12 | 6, 7, 11 | mpanl12 701 | . . 3 ⊢ ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵‘𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥)))) → 𝐹 = 𝐵) |
13 | 5, 12 | sylan2br 594 | . 2 ⊢ ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵‘𝑥) = (𝐺‘(𝐵 ↾ 𝑥))) → 𝐹 = 𝐵) |
14 | 13 | eqcomd 2746 | 1 ⊢ ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵‘𝑥) = (𝐺‘(𝐵 ↾ 𝑥))) → 𝐵 = 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∀wral 3067 E cep 5598 Se wse 5650 We wwe 5651 ↾ cres 5702 Predcpred 6331 Oncon0 6395 Fn wfn 6568 ‘cfv 6573 wrecscwrecs 8352 recscrecs 8426 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pr 5447 ax-un 7770 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-se 5653 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ov 7451 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |