Theorem bnj1500 35203

Description: Well-founded recursion, part 2 of 3. The proof has been taken from Chapter 4 of Don Monk's notes on Set Theory. See http://euclid.colorado.edu/~monkd/setth.pdf. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj1500.1	⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1500.2	⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1500.3	⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1500.4	⊢ 𝐹 = ∪ 𝐶

Assertion

Ref	Expression
bnj1500	⊢ (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))

Distinct variable groups:   𝐴,𝑑,𝑓,𝑥   𝐵,𝑓   𝐺,𝑑,𝑓,𝑥   𝑅,𝑑,𝑓,𝑥   𝑌,𝑑

Allowed substitution hints:   𝐵(𝑥,𝑑)   𝐶(𝑥,𝑓,𝑑)   𝐹(𝑥,𝑓,𝑑)   𝑌(𝑥,𝑓)

Proof of Theorem bnj1500

Step	Hyp	Ref	Expression
1		bnj1500.1	. 2 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
2		bnj1500.2	. 2 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
3		bnj1500.3	. 2 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
4		bnj1500.4	. 2 ⊢ 𝐹 = ∪ 𝐶
5		biid 261	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ↔ (𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴))
6		biid 261	. 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑓 ∈ 𝐶 ∧ 𝑥 ∈ dom 𝑓) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑓 ∈ 𝐶 ∧ 𝑥 ∈ dom 𝑓))
7		biid 261	. 2 ⊢ ((((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑓 ∈ 𝐶 ∧ 𝑥 ∈ dom 𝑓) ∧ 𝑑 ∈ 𝐵 ∧ dom 𝑓 = 𝑑) ↔ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑓 ∈ 𝐶 ∧ 𝑥 ∈ dom 𝑓) ∧ 𝑑 ∈ 𝐵 ∧ dom 𝑓 = 𝑑))
8	1, 2, 3, 4, 5, 6, 7	bnj1501 35202	1 ⊢ (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  {cab 2713  ∀wral 3050  ∃wrex 3059   ⊆ wss 3900  ⟨cop 4585  ∪ cuni 4862  dom cdm 5623   ↾ cres 5625   Fn wfn 6486  ‘cfv 6491   predc-bnj14 34823   FrSe w-bnj15 34827

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-rep 5223  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680  ax-reg 9499  ax-inf2 9552

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-reu 3350  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4947  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-ord 6319  df-on 6320  df-lim 6321  df-suc 6322  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-om 7809  df-1o 8397  df-bnj17 34822  df-bnj14 34824  df-bnj13 34826  df-bnj15 34828  df-bnj18 34830  df-bnj19 34832

This theorem is referenced by:  bnj1523  35206