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

Theorem tfr3ALT 8393
Description: Alternate proof of tfr3 8390 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 7787 . . . . . . 7 (𝑥 ∈ On → Pred( E , On, 𝑥) = 𝑥)
21reseq2d 5973 . . . . . 6 (𝑥 ∈ On → (𝐵 ↾ Pred( E , On, 𝑥)) = (𝐵𝑥))
32fveq2d 6884 . . . . 5 (𝑥 ∈ On → (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))) = (𝐺‘(𝐵𝑥)))
43eqeq2d 2771 . . . 4 (𝑥 ∈ On → ((𝐵𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))) ↔ (𝐵𝑥) = (𝐺‘(𝐵𝑥))))
54ralbiia 3106 . . 3 (∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))) ↔ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵𝑥)))
6 epweon 7776 . . . 4 E We On
7 epse 5637 . . . 4 E Se On
8 tfrALT.1 . . . . . 6 𝐹 = recs(𝐺)
9 df-recs 8362 . . . . . 6 recs(𝐺) = wrecs( E , On, 𝐺)
108, 9eqtri 2783 . . . . 5 𝐹 = wrecs( E , On, 𝐺)
1110wfr3 8329 . . . 4 ((( E We On ∧ E Se On) ∧ (𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥))))) → 𝐹 = 𝐵)
126, 7, 11mpanl12 715 . . 3 ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵 ↾ Pred( E , On, 𝑥)))) → 𝐹 = 𝐵)
135, 12sylan2br 607 . 2 ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵𝑥))) → 𝐹 = 𝐵)
1413eqcomd 2766 1 ((𝐵 Fn On ∧ ∀𝑥 ∈ On (𝐵𝑥) = (𝐺‘(𝐵𝑥))) → 𝐵 = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wral 3076   E cep 5554   Se wse 5606   We wwe 5607  cres 5657  Predcpred 6299  Oncon0 6358   Fn wfn 6529  cfv 6534  wrecscwrecs 8312  recscrecs 8361
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6300  df-ord 6361  df-on 6362  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-f1 6539  df-fo 6540  df-f1o 6541  df-fv 6542  df-ov 7418  df-2nd 7989  df-frecs 8282  df-wrecs 8313  df-recs 8362
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator