Theorem bnj1500 35564

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 264	. 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ↔ (𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴))
6		biid 264	. 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑓 ∈ 𝐶 ∧ 𝑥 ∈ dom 𝑓) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑓 ∈ 𝐶 ∧ 𝑥 ∈ dom 𝑓))
7		biid 264	. 2 ⊢ ((((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑓 ∈ 𝐶 ∧ 𝑥 ∈ dom 𝑓) ∧ 𝑑 ∈ 𝐵 ∧ dom 𝑓 = 𝑑) ↔ (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ 𝑓 ∈ 𝐶 ∧ 𝑥 ∈ dom 𝑓) ∧ 𝑑 ∈ 𝐵 ∧ dom 𝑓 = 𝑑))
8	1, 2, 3, 4, 5, 6, 7	bnj1501 35563	1 ⊢ (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘⟨𝑥, (𝐹 ↾ pred(𝑥, 𝐴, 𝑅))⟩))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {cab 2740  ∀wral 3078  ∃wrex 3088   ⊆ wss 3902  ⟨cop 4593  ∪ cuni 4870  dom cdm 5659   ↾ cres 5661   Fn wfn 6532  ‘cfv 6537   predc-bnj14 35185   FrSe w-bnj15 35189

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-reg 9567  ax-inf2 9623

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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-om 7866  df-1o 8458  df-bnj17 35184  df-bnj14 35186  df-bnj13 35188  df-bnj15 35190  df-bnj18 35192  df-bnj19 35194

This theorem is used by:  bnj1523  35567