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

Theorem wfr2 8052
Description: The Principle of Well-Ordered Recursion, part 2 of 3. Next, we show that the value of 𝐹 at any 𝑋𝐴 is 𝐺 recursively applied to all "previous" values of 𝐹. (Contributed by Scott Fenton, 18-Apr-2011.) (Revised by Mario Carneiro, 26-Jun-2015.)
Hypotheses
Ref Expression
wfr2.1 𝑅 We 𝐴
wfr2.2 𝑅 Se 𝐴
wfr2.3 𝐹 = wrecs(𝑅, 𝐴, 𝐺)
Assertion
Ref Expression
wfr2 (𝑋𝐴 → (𝐹𝑋) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋))))

Proof of Theorem wfr2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 wfr2.1 . . . 4 𝑅 We 𝐴
2 wfr2.2 . . . 4 𝑅 Se 𝐴
3 wfr2.3 . . . 4 𝐹 = wrecs(𝑅, 𝐴, 𝐺)
4 eqid 2736 . . . 4 (𝐹 ∪ {⟨𝑥, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑥)))⟩}) = (𝐹 ∪ {⟨𝑥, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑥)))⟩})
51, 2, 3, 4wfrlem16 8048 . . 3 dom 𝐹 = 𝐴
65eleq2i 2822 . 2 (𝑋 ∈ dom 𝐹𝑋𝐴)
71, 2, 3wfr2a 8050 . 2 (𝑋 ∈ dom 𝐹 → (𝐹𝑋) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋))))
86, 7sylbir 238 1 (𝑋𝐴 → (𝐹𝑋) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋))))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1543  wcel 2112  cun 3851  {csn 4527  cop 4533   Se wse 5492   We wwe 5493  dom cdm 5536  cres 5538  Predcpred 6139  cfv 6358  wrecscwrecs 8024
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pr 5307  ax-un 7501
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-reu 3058  df-rmo 3059  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-iun 4892  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-po 5453  df-so 5454  df-fr 5494  df-se 5495  df-we 5496  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-pred 6140  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-wrecs 8025
This theorem is referenced by:  wfr3  8053  tfr2ALT  8115  bpolylem  15573
  Copyright terms: Public domain W3C validator