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

Theorem frr2 9732
Description: Law of general well-founded recursion, part two. Now we establish the value of 𝐹 within 𝐴. (Contributed by Scott Fenton, 11-Sep-2023.)
Hypothesis
Ref Expression
frr.1 𝐹 = frecs(𝑅, 𝐴, 𝐺)
Assertion
Ref Expression
frr2 (((𝑅 Fr 𝐴𝑅 Se 𝐴) ∧ 𝑋𝐴) → (𝐹𝑋) = (𝑋𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋))))

Proof of Theorem frr2
Dummy variables 𝑥 𝑦 𝑢 𝑣 𝑎 𝑏 𝑐 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 frr.1 . . . . . 6 𝐹 = frecs(𝑅, 𝐴, 𝐺)
21frr1 9731 . . . . 5 ((𝑅 Fr 𝐴𝑅 Se 𝐴) → 𝐹 Fn 𝐴)
32fndmd 6641 . . . 4 ((𝑅 Fr 𝐴𝑅 Se 𝐴) → dom 𝐹 = 𝐴)
43eleq2d 2855 . . 3 ((𝑅 Fr 𝐴𝑅 Se 𝐴) → (𝑋 ∈ dom 𝐹𝑋𝐴))
54pm5.32i 584 . 2 (((𝑅 Fr 𝐴𝑅 Se 𝐴) ∧ 𝑋 ∈ dom 𝐹) ↔ ((𝑅 Fr 𝐴𝑅 Se 𝐴) ∧ 𝑋𝐴))
6 fveq2 6882 . . . . . 6 (𝑦 = 𝑋 → (𝐹𝑦) = (𝐹𝑋))
7 id 23 . . . . . . 7 (𝑦 = 𝑋𝑦 = 𝑋)
8 predeq3 6307 . . . . . . . 8 (𝑦 = 𝑋 → Pred(𝑅, 𝐴, 𝑦) = Pred(𝑅, 𝐴, 𝑋))
98reseq2d 5979 . . . . . . 7 (𝑦 = 𝑋 → (𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)) = (𝐹 ↾ Pred(𝑅, 𝐴, 𝑋)))
107, 9oveq12d 7429 . . . . . 6 (𝑦 = 𝑋 → (𝑦𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) = (𝑋𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋))))
116, 10eqeq12d 2785 . . . . 5 (𝑦 = 𝑋 → ((𝐹𝑦) = (𝑦𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))) ↔ (𝐹𝑋) = (𝑋𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋)))))
1211imbi2d 343 . . . 4 (𝑦 = 𝑋 → (((𝑅 Fr 𝐴𝑅 Se 𝐴) → (𝐹𝑦) = (𝑦𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))) ↔ ((𝑅 Fr 𝐴𝑅 Se 𝐴) → (𝐹𝑋) = (𝑋𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋))))))
13 eqid 2769 . . . . . . 7 {𝑎 ∣ ∃𝑏(𝑎 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑐𝑏 Pred(𝑅, 𝐴, 𝑐) ⊆ 𝑏) ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝑐𝐺(𝑎 ↾ Pred(𝑅, 𝐴, 𝑐))))} = {𝑎 ∣ ∃𝑏(𝑎 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑐𝑏 Pred(𝑅, 𝐴, 𝑐) ⊆ 𝑏) ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝑐𝐺(𝑎 ↾ Pred(𝑅, 𝐴, 𝑐))))}
1413frrlem1 8283 . . . . . 6 {𝑎 ∣ ∃𝑏(𝑎 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑐𝑏 Pred(𝑅, 𝐴, 𝑐) ⊆ 𝑏) ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝑐𝐺(𝑎 ↾ Pred(𝑅, 𝐴, 𝑐))))} = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥𝐴 ∧ ∀𝑦𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦𝑥 (𝑓𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))}
1514, 1frrlem15 9729 . . . . . 6 (((𝑅 Fr 𝐴𝑅 Se 𝐴) ∧ (𝑔 ∈ {𝑎 ∣ ∃𝑏(𝑎 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑐𝑏 Pred(𝑅, 𝐴, 𝑐) ⊆ 𝑏) ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝑐𝐺(𝑎 ↾ Pred(𝑅, 𝐴, 𝑐))))} ∧ ∈ {𝑎 ∣ ∃𝑏(𝑎 Fn 𝑏 ∧ (𝑏𝐴 ∧ ∀𝑐𝑏 Pred(𝑅, 𝐴, 𝑐) ⊆ 𝑏) ∧ ∀𝑐𝑏 (𝑎𝑐) = (𝑐𝐺(𝑎 ↾ Pred(𝑅, 𝐴, 𝑐))))})) → ((𝑥𝑔𝑢𝑥𝑣) → 𝑢 = 𝑣))
1614, 1, 15frrlem10 8292 . . . . 5 (((𝑅 Fr 𝐴𝑅 Se 𝐴) ∧ 𝑦 ∈ dom 𝐹) → (𝐹𝑦) = (𝑦𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦))))
1716expcom 418 . . . 4 (𝑦 ∈ dom 𝐹 → ((𝑅 Fr 𝐴𝑅 Se 𝐴) → (𝐹𝑦) = (𝑦𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑦)))))
1812, 17vtoclga 3550 . . 3 (𝑋 ∈ dom 𝐹 → ((𝑅 Fr 𝐴𝑅 Se 𝐴) → (𝐹𝑋) = (𝑋𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋)))))
1918impcom 412 . 2 (((𝑅 Fr 𝐴𝑅 Se 𝐴) ∧ 𝑋 ∈ dom 𝐹) → (𝐹𝑋) = (𝑋𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋))))
205, 19sylbir 238 1 (((𝑅 Fr 𝐴𝑅 Se 𝐴) ∧ 𝑋𝐴) → (𝐹𝑋) = (𝑋𝐺(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101   = wceq 1567  wex 1806  wcel 2149  {cab 2747  wral 3085  wss 3913   Fr wfr 5612   Se wse 5613  dom cdm 5662  cres 5664  Predcpred 6302   Fn wfn 6532  cfv 6537  (class class class)co 7411  frecscfrecs 8277
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pr 5405  ax-un 7733  ax-inf2 9610
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-se 5616  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-oadd 8457  df-ttrcl 9677
This theorem is referenced by:  frr3  9733
  Copyright terms: Public domain W3C validator