MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tfr3ALT Structured version   Visualization version   GIF version

Theorem tfr3ALT 8385
Description: Alternate proof of tfr3 8382 using well-ordered recursion. (Contributed by Scott Fenton, 3-Aug-2020.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
tfrALT.1 𝐹 = recs(𝐺)
Assertion
Ref Expression
tfr3ALT ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵𝑥))) → 𝐵 = 𝐹)
Distinct variable groups:   𝑥,𝐵   𝑥,𝐺   𝑥,𝐹

Proof of Theorem tfr3ALT
StepHypRef Expression
1 predon 7781 . . . . . . 7 (𝑥 ∈ On → Pred( E , On, 𝑥) = 𝑥)
21reseq2d 5978 . . . . . 6 (𝑥 ∈ On → (𝐵 ↾ Pred( E , On, 𝑥)) = (𝐵𝑥))
32fveq2d 6885 . . . . 5 (𝑥 ∈ On → (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))) = (𝐺‘(𝐵𝑥)))
43eqeq2d 2774 . . . 4 (𝑥 ∈ On → ((𝐵𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))) ↔ (𝐵𝑥) = (𝐺‘(𝐵𝑥))))
54ralbiia 3109 . . 3 (∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))) ↔ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵𝑥)))
6 epweon 7770 . . . 4 E We On
7 epse 5643 . . . 4 E Se On
8 tfrALT.1 . . . . . 6 𝐹 = recs(𝐺)
9 df-recs 8354 . . . . . 6 recs(𝐺) = wrecs( E , On, 𝐺)
108, 9eqtri 2786 . . . . 5 𝐹 = wrecs( E , On, 𝐺)
1110wfr3 8321 . . . 4 ((( E We On ∧ E Se On) ∧ (𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))))) → 𝐹 = 𝐵)
126, 7, 11mpanl12 714 . . 3 ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥)))) → 𝐹 = 𝐵)
135, 12sylan2br 606 . 2 ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵𝑥))) → 𝐹 = 𝐵)
1413eqcomd 2769 1 ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵𝑥))) → 𝐵 = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400   = wceq 1570  wcel 2143  wral 3079   E cep 5560   Se wse 5612   We wwe 5613  cres 5663  Predcpred 6301  Oncon0 6360   Fn wfn 6531  cfv 6536  wrecscwrecs 8304  recscrecs 8353
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-se 5615  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator