Theorem rdglim2 8363

Description: The value of the recursive definition generator at a limit ordinal, in terms of the union of all smaller values. (Contributed by NM, 23-Apr-1995.)

Assertion

Ref	Expression
rdglim2	⊢ ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → (rec(𝐹, 𝐴)‘𝐵) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 = (rec(𝐹, 𝐴)‘𝑥)})

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦

Allowed substitution hints:   𝐶(𝑥,𝑦)

Proof of Theorem rdglim2

Step	Hyp	Ref	Expression
1		rdglim 8357	. 2 ⊢ ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → (rec(𝐹, 𝐴)‘𝐵) = ∪ (rec(𝐹, 𝐴) “ 𝐵))
2		dfima3 6022	. . . . 5 ⊢ (rec(𝐹, 𝐴) “ 𝐵) = {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ rec(𝐹, 𝐴))}
3		df-rex 3061	. . . . . . 7 ⊢ (∃𝑥 ∈ 𝐵 𝑦 = (rec(𝐹, 𝐴)‘𝑥) ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑦 = (rec(𝐹, 𝐴)‘𝑥)))
4		limord 6378	. . . . . . . . . . 11 ⊢ (Lim 𝐵 → Ord 𝐵)
5		ordelord 6339	. . . . . . . . . . . . 13 ⊢ ((Ord 𝐵 ∧ 𝑥 ∈ 𝐵) → Ord 𝑥)
6	5	ex 412	. . . . . . . . . . . 12 ⊢ (Ord 𝐵 → (𝑥 ∈ 𝐵 → Ord 𝑥))
7		vex 3444	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
8	7	elon 6326	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ On ↔ Ord 𝑥)
9	6, 8	imbitrrdi 252	. . . . . . . . . . 11 ⊢ (Ord 𝐵 → (𝑥 ∈ 𝐵 → 𝑥 ∈ On))
10	4, 9	syl 17	. . . . . . . . . 10 ⊢ (Lim 𝐵 → (𝑥 ∈ 𝐵 → 𝑥 ∈ On))
11		eqcom 2743	. . . . . . . . . . 11 ⊢ (𝑦 = (rec(𝐹, 𝐴)‘𝑥) ↔ (rec(𝐹, 𝐴)‘𝑥) = 𝑦)
12		rdgfnon 8349	. . . . . . . . . . . 12 ⊢ rec(𝐹, 𝐴) Fn On
13		fnopfvb 6885	. . . . . . . . . . . 12 ⊢ ((rec(𝐹, 𝐴) Fn On ∧ 𝑥 ∈ On) → ((rec(𝐹, 𝐴)‘𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ rec(𝐹, 𝐴)))
14	12, 13	mpan 690	. . . . . . . . . . 11 ⊢ (𝑥 ∈ On → ((rec(𝐹, 𝐴)‘𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ rec(𝐹, 𝐴)))
15	11, 14	bitrid 283	. . . . . . . . . 10 ⊢ (𝑥 ∈ On → (𝑦 = (rec(𝐹, 𝐴)‘𝑥) ↔ ⟨𝑥, 𝑦⟩ ∈ rec(𝐹, 𝐴)))
16	10, 15	syl6 35	. . . . . . . . 9 ⊢ (Lim 𝐵 → (𝑥 ∈ 𝐵 → (𝑦 = (rec(𝐹, 𝐴)‘𝑥) ↔ ⟨𝑥, 𝑦⟩ ∈ rec(𝐹, 𝐴))))
17	16	pm5.32d 577	. . . . . . . 8 ⊢ (Lim 𝐵 → ((𝑥 ∈ 𝐵 ∧ 𝑦 = (rec(𝐹, 𝐴)‘𝑥)) ↔ (𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ rec(𝐹, 𝐴))))
18	17	exbidv 1922	. . . . . . 7 ⊢ (Lim 𝐵 → (∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑦 = (rec(𝐹, 𝐴)‘𝑥)) ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ rec(𝐹, 𝐴))))
19	3, 18	bitr2id 284	. . . . . 6 ⊢ (Lim 𝐵 → (∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ rec(𝐹, 𝐴)) ↔ ∃𝑥 ∈ 𝐵 𝑦 = (rec(𝐹, 𝐴)‘𝑥)))
20	19	abbidv 2802	. . . . 5 ⊢ (Lim 𝐵 → {𝑦 ∣ ∃𝑥(𝑥 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ rec(𝐹, 𝐴))} = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 = (rec(𝐹, 𝐴)‘𝑥)})
21	2, 20	eqtrid 2783	. . . 4 ⊢ (Lim 𝐵 → (rec(𝐹, 𝐴) “ 𝐵) = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 = (rec(𝐹, 𝐴)‘𝑥)})
22	21	unieqd 4876	. . 3 ⊢ (Lim 𝐵 → ∪ (rec(𝐹, 𝐴) “ 𝐵) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 = (rec(𝐹, 𝐴)‘𝑥)})
23	22	adantl 481	. 2 ⊢ ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → ∪ (rec(𝐹, 𝐴) “ 𝐵) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 = (rec(𝐹, 𝐴)‘𝑥)})
24	1, 23	eqtrd 2771	1 ⊢ ((𝐵 ∈ 𝐶 ∧ Lim 𝐵) → (rec(𝐹, 𝐴)‘𝐵) = ∪ {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 = (rec(𝐹, 𝐴)‘𝑥)})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541  ∃wex 1780   ∈ wcel 2113  {cab 2714  ∃wrex 3060  ⟨cop 4586  ∪ cuni 4863   “ cima 5627  Ord word 6316  Oncon0 6317  Lim wlim 6318   Fn wfn 6487  ‘cfv 6492  reccrdg 8340

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341

This theorem is referenced by:  rdglim2a  8364