Theorem itunisuc 10106

Description: Successor iterated union. (Contributed by Stefan O'Rear, 11-Feb-2015.)

Hypothesis

Ref	Expression
ituni.u	⊢ 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω))

Assertion

Ref	Expression
itunisuc	⊢ ((𝑈‘𝐴)‘suc 𝐵) = ∪ ((𝑈‘𝐴)‘𝐵)

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

Allowed substitution hints:   𝑈(𝑥,𝑦)

Proof of Theorem itunisuc

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		frsuc 8238	. . . . . 6 ⊢ (𝐵 ∈ ω → ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘suc 𝐵) = ((𝑦 ∈ V ↦ ∪ 𝑦)‘((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵)))
2		fvex 6769	. . . . . . 7 ⊢ ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵) ∈ V
3		unieq 4847	. . . . . . . 8 ⊢ (𝑎 = ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵) → ∪ 𝑎 = ∪ ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵))
4		unieq 4847	. . . . . . . . 9 ⊢ (𝑦 = 𝑎 → ∪ 𝑦 = ∪ 𝑎)
5	4	cbvmptv 5183	. . . . . . . 8 ⊢ (𝑦 ∈ V ↦ ∪ 𝑦) = (𝑎 ∈ V ↦ ∪ 𝑎)
6	2	uniex 7572	. . . . . . . 8 ⊢ ∪ ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵) ∈ V
7	3, 5, 6	fvmpt 6857	. . . . . . 7 ⊢ (((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵) ∈ V → ((𝑦 ∈ V ↦ ∪ 𝑦)‘((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵)) = ∪ ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵))
8	2, 7	ax-mp 5	. . . . . 6 ⊢ ((𝑦 ∈ V ↦ ∪ 𝑦)‘((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵)) = ∪ ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵)
9	1, 8	eqtrdi 2795	. . . . 5 ⊢ (𝐵 ∈ ω → ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘suc 𝐵) = ∪ ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵))
10	9	adantl 481	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ ω) → ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘suc 𝐵) = ∪ ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵))
11		ituni.u	. . . . . . 7 ⊢ 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω))
12	11	itunifval 10103	. . . . . 6 ⊢ (𝐴 ∈ V → (𝑈‘𝐴) = (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω))
13	12	fveq1d 6758	. . . . 5 ⊢ (𝐴 ∈ V → ((𝑈‘𝐴)‘suc 𝐵) = ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘suc 𝐵))
14	13	adantr 480	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ ω) → ((𝑈‘𝐴)‘suc 𝐵) = ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘suc 𝐵))
15	12	fveq1d 6758	. . . . . 6 ⊢ (𝐴 ∈ V → ((𝑈‘𝐴)‘𝐵) = ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵))
16	15	adantr 480	. . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ ω) → ((𝑈‘𝐴)‘𝐵) = ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵))
17	16	unieqd 4850	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ ω) → ∪ ((𝑈‘𝐴)‘𝐵) = ∪ ((rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝐴) ↾ ω)‘𝐵))
18	10, 14, 17	3eqtr4d 2788	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ ω) → ((𝑈‘𝐴)‘suc 𝐵) = ∪ ((𝑈‘𝐴)‘𝐵))
19		uni0 4866	. . . . 5 ⊢ ∪ ∅ = ∅
20	19	eqcomi 2747	. . . 4 ⊢ ∅ = ∪ ∅
21	11	itunifn 10104	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → (𝑈‘𝐴) Fn ω)
22	21	fndmd 6522	. . . . . . . . 9 ⊢ (𝐴 ∈ V → dom (𝑈‘𝐴) = ω)
23	22	eleq2d 2824	. . . . . . . 8 ⊢ (𝐴 ∈ V → (suc 𝐵 ∈ dom (𝑈‘𝐴) ↔ suc 𝐵 ∈ ω))
24		peano2b 7704	. . . . . . . 8 ⊢ (𝐵 ∈ ω ↔ suc 𝐵 ∈ ω)
25	23, 24	bitr4di 288	. . . . . . 7 ⊢ (𝐴 ∈ V → (suc 𝐵 ∈ dom (𝑈‘𝐴) ↔ 𝐵 ∈ ω))
26	25	notbid 317	. . . . . 6 ⊢ (𝐴 ∈ V → (¬ suc 𝐵 ∈ dom (𝑈‘𝐴) ↔ ¬ 𝐵 ∈ ω))
27	26	biimpar 477	. . . . 5 ⊢ ((𝐴 ∈ V ∧ ¬ 𝐵 ∈ ω) → ¬ suc 𝐵 ∈ dom (𝑈‘𝐴))
28		ndmfv 6786	. . . . 5 ⊢ (¬ suc 𝐵 ∈ dom (𝑈‘𝐴) → ((𝑈‘𝐴)‘suc 𝐵) = ∅)
29	27, 28	syl 17	. . . 4 ⊢ ((𝐴 ∈ V ∧ ¬ 𝐵 ∈ ω) → ((𝑈‘𝐴)‘suc 𝐵) = ∅)
30	22	eleq2d 2824	. . . . . . . 8 ⊢ (𝐴 ∈ V → (𝐵 ∈ dom (𝑈‘𝐴) ↔ 𝐵 ∈ ω))
31	30	notbid 317	. . . . . . 7 ⊢ (𝐴 ∈ V → (¬ 𝐵 ∈ dom (𝑈‘𝐴) ↔ ¬ 𝐵 ∈ ω))
32	31	biimpar 477	. . . . . 6 ⊢ ((𝐴 ∈ V ∧ ¬ 𝐵 ∈ ω) → ¬ 𝐵 ∈ dom (𝑈‘𝐴))
33		ndmfv 6786	. . . . . 6 ⊢ (¬ 𝐵 ∈ dom (𝑈‘𝐴) → ((𝑈‘𝐴)‘𝐵) = ∅)
34	32, 33	syl 17	. . . . 5 ⊢ ((𝐴 ∈ V ∧ ¬ 𝐵 ∈ ω) → ((𝑈‘𝐴)‘𝐵) = ∅)
35	34	unieqd 4850	. . . 4 ⊢ ((𝐴 ∈ V ∧ ¬ 𝐵 ∈ ω) → ∪ ((𝑈‘𝐴)‘𝐵) = ∪ ∅)
36	20, 29, 35	3eqtr4a 2805	. . 3 ⊢ ((𝐴 ∈ V ∧ ¬ 𝐵 ∈ ω) → ((𝑈‘𝐴)‘suc 𝐵) = ∪ ((𝑈‘𝐴)‘𝐵))
37	18, 36	pm2.61dan 809	. 2 ⊢ (𝐴 ∈ V → ((𝑈‘𝐴)‘suc 𝐵) = ∪ ((𝑈‘𝐴)‘𝐵))
38		0fv 6795	. . . . 5 ⊢ (∅‘𝐵) = ∅
39	38	unieqi 4849	. . . 4 ⊢ ∪ (∅‘𝐵) = ∪ ∅
40		0fv 6795	. . . 4 ⊢ (∅‘suc 𝐵) = ∅
41	19, 39, 40	3eqtr4ri 2777	. . 3 ⊢ (∅‘suc 𝐵) = ∪ (∅‘𝐵)
42		fvprc 6748	. . . 4 ⊢ (¬ 𝐴 ∈ V → (𝑈‘𝐴) = ∅)
43	42	fveq1d 6758	. . 3 ⊢ (¬ 𝐴 ∈ V → ((𝑈‘𝐴)‘suc 𝐵) = (∅‘suc 𝐵))
44	42	fveq1d 6758	. . . 4 ⊢ (¬ 𝐴 ∈ V → ((𝑈‘𝐴)‘𝐵) = (∅‘𝐵))
45	44	unieqd 4850	. . 3 ⊢ (¬ 𝐴 ∈ V → ∪ ((𝑈‘𝐴)‘𝐵) = ∪ (∅‘𝐵))
46	41, 43, 45	3eqtr4a 2805	. 2 ⊢ (¬ 𝐴 ∈ V → ((𝑈‘𝐴)‘suc 𝐵) = ∪ ((𝑈‘𝐴)‘𝐵))
47	37, 46	pm2.61i 182	1 ⊢ ((𝑈‘𝐴)‘suc 𝐵) = ∪ ((𝑈‘𝐴)‘𝐵)

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1539   ∈ wcel 2108  Vcvv 3422  ∅c0 4253  ∪ cuni 4836   ↦ cmpt 5153  dom cdm 5580   ↾ cres 5582  suc csuc 6253  ‘cfv 6418  ωcom 7687  reccrdg 8211

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566  ax-inf2 9329

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212

This theorem is referenced by:  itunitc1  10107  itunitc  10108  ituniiun  10109