Theorem wfr2 7321

Description: The Principle of Well-Founded 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.

Step	Hyp	Ref	Expression
1		wfr2.1	. . . 4 ⊢ 𝑅 We 𝐴
2		wfr2.2	. . . 4 ⊢ 𝑅 Se 𝐴
3		wfr2.3	. . . 4 ⊢ 𝐹 = wrecs(𝑅, 𝐴, 𝐺)
4		eqid 2610	. . . 4 ⊢ (𝐹 ∪ {⟨𝑥, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑥)))⟩}) = (𝐹 ∪ {⟨𝑥, (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑥)))⟩})
5	1, 2, 3, 4	wfrlem16 7317	. . 3 ⊢ dom 𝐹 = 𝐴
6	5	eleq2i 2680	. 2 ⊢ (𝑋 ∈ dom 𝐹 ↔ 𝑋 ∈ 𝐴)
7	1, 2, 3	wfr2a 7319	. 2 ⊢ (𝑋 ∈ dom 𝐹 → (𝐹‘𝑋) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋))))
8	6, 7	sylbir 224	1 ⊢ (𝑋 ∈ 𝐴 → (𝐹‘𝑋) = (𝐺‘(𝐹 ↾ Pred(𝑅, 𝐴, 𝑋))))

Syntax hints:   → wi 4   = wceq 1475   ∈ wcel 1977   ∪ cun 3538  {csn 4125  ⟨cop 4131   Se wse 4995   We wwe 4996  dom cdm 5038   ↾ cres 5040  Predcpred 5596  ‘cfv 5804  wrecscwrecs 7293

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-wrecs 7294

This theorem is referenced by:  wfr3  7322  tfr2ALT  7384  bpolylem  14618