Theorem itunitc 9832

Description: The union of all union iterates creates the transitive closure; compare trcl 9154. (Contributed by Stefan O'Rear, 11-Feb-2015.)

Hypothesis

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

Assertion

Ref	Expression
itunitc	⊢ (TC‘𝐴) = ∪ ran (𝑈‘𝐴)

Distinct variable group:   𝑥,𝐴,𝑦

Allowed substitution hints:   𝑈(𝑥,𝑦)

Proof of Theorem itunitc

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6645	. . . 4 ⊢ (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
2		fveq2 6645	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑈‘𝑎) = (𝑈‘𝐴))
3	2	rneqd 5772	. . . . 5 ⊢ (𝑎 = 𝐴 → ran (𝑈‘𝑎) = ran (𝑈‘𝐴))
4	3	unieqd 4814	. . . 4 ⊢ (𝑎 = 𝐴 → ∪ ran (𝑈‘𝑎) = ∪ ran (𝑈‘𝐴))
5	1, 4	eqeq12d 2814	. . 3 ⊢ (𝑎 = 𝐴 → ((TC‘𝑎) = ∪ ran (𝑈‘𝑎) ↔ (TC‘𝐴) = ∪ ran (𝑈‘𝐴)))
6		ituni.u	. . . . . . . 8 ⊢ 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω))
7	6	ituni0 9829	. . . . . . 7 ⊢ (𝑎 ∈ V → ((𝑈‘𝑎)‘∅) = 𝑎)
8	7	elv 3446	. . . . . 6 ⊢ ((𝑈‘𝑎)‘∅) = 𝑎
9		fvssunirn 6674	. . . . . 6 ⊢ ((𝑈‘𝑎)‘∅) ⊆ ∪ ran (𝑈‘𝑎)
10	8, 9	eqsstrri 3950	. . . . 5 ⊢ 𝑎 ⊆ ∪ ran (𝑈‘𝑎)
11		dftr3 5140	. . . . . 6 ⊢ (Tr ∪ ran (𝑈‘𝑎) ↔ ∀𝑏 ∈ ∪ ran (𝑈‘𝑎)𝑏 ⊆ ∪ ran (𝑈‘𝑎))
12		vex 3444	. . . . . . . 8 ⊢ 𝑎 ∈ V
13	6	itunifn 9828	. . . . . . . 8 ⊢ (𝑎 ∈ V → (𝑈‘𝑎) Fn ω)
14		fnunirn 6990	. . . . . . . 8 ⊢ ((𝑈‘𝑎) Fn ω → (𝑏 ∈ ∪ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈‘𝑎)‘𝑐)))
15	12, 13, 14	mp2b 10	. . . . . . 7 ⊢ (𝑏 ∈ ∪ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈‘𝑎)‘𝑐))
16		elssuni 4830	. . . . . . . . 9 ⊢ (𝑏 ∈ ((𝑈‘𝑎)‘𝑐) → 𝑏 ⊆ ∪ ((𝑈‘𝑎)‘𝑐))
17	6	itunisuc 9830	. . . . . . . . . 10 ⊢ ((𝑈‘𝑎)‘suc 𝑐) = ∪ ((𝑈‘𝑎)‘𝑐)
18		fvssunirn 6674	. . . . . . . . . 10 ⊢ ((𝑈‘𝑎)‘suc 𝑐) ⊆ ∪ ran (𝑈‘𝑎)
19	17, 18	eqsstrri 3950	. . . . . . . . 9 ⊢ ∪ ((𝑈‘𝑎)‘𝑐) ⊆ ∪ ran (𝑈‘𝑎)
20	16, 19	sstrdi 3927	. . . . . . . 8 ⊢ (𝑏 ∈ ((𝑈‘𝑎)‘𝑐) → 𝑏 ⊆ ∪ ran (𝑈‘𝑎))
21	20	rexlimivw 3241	. . . . . . 7 ⊢ (∃𝑐 ∈ ω 𝑏 ∈ ((𝑈‘𝑎)‘𝑐) → 𝑏 ⊆ ∪ ran (𝑈‘𝑎))
22	15, 21	sylbi 220	. . . . . 6 ⊢ (𝑏 ∈ ∪ ran (𝑈‘𝑎) → 𝑏 ⊆ ∪ ran (𝑈‘𝑎))
23	11, 22	mprgbir 3121	. . . . 5 ⊢ Tr ∪ ran (𝑈‘𝑎)
24		tcmin 9167	. . . . . 6 ⊢ (𝑎 ∈ V → ((𝑎 ⊆ ∪ ran (𝑈‘𝑎) ∧ Tr ∪ ran (𝑈‘𝑎)) → (TC‘𝑎) ⊆ ∪ ran (𝑈‘𝑎)))
25	24	elv 3446	. . . . 5 ⊢ ((𝑎 ⊆ ∪ ran (𝑈‘𝑎) ∧ Tr ∪ ran (𝑈‘𝑎)) → (TC‘𝑎) ⊆ ∪ ran (𝑈‘𝑎))
26	10, 23, 25	mp2an 691	. . . 4 ⊢ (TC‘𝑎) ⊆ ∪ ran (𝑈‘𝑎)
27		unissb 4832	. . . . 5 ⊢ (∪ ran (𝑈‘𝑎) ⊆ (TC‘𝑎) ↔ ∀𝑏 ∈ ran (𝑈‘𝑎)𝑏 ⊆ (TC‘𝑎))
28		fvelrnb 6701	. . . . . . 7 ⊢ ((𝑈‘𝑎) Fn ω → (𝑏 ∈ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω ((𝑈‘𝑎)‘𝑐) = 𝑏))
29	12, 13, 28	mp2b 10	. . . . . 6 ⊢ (𝑏 ∈ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω ((𝑈‘𝑎)‘𝑐) = 𝑏)
30	6	itunitc1 9831	. . . . . . . . 9 ⊢ ((𝑈‘𝑎)‘𝑐) ⊆ (TC‘𝑎)
31	30	a1i 11	. . . . . . . 8 ⊢ (𝑐 ∈ ω → ((𝑈‘𝑎)‘𝑐) ⊆ (TC‘𝑎))
32		sseq1 3940	. . . . . . . 8 ⊢ (((𝑈‘𝑎)‘𝑐) = 𝑏 → (((𝑈‘𝑎)‘𝑐) ⊆ (TC‘𝑎) ↔ 𝑏 ⊆ (TC‘𝑎)))
33	31, 32	syl5ibcom 248	. . . . . . 7 ⊢ (𝑐 ∈ ω → (((𝑈‘𝑎)‘𝑐) = 𝑏 → 𝑏 ⊆ (TC‘𝑎)))
34	33	rexlimiv 3239	. . . . . 6 ⊢ (∃𝑐 ∈ ω ((𝑈‘𝑎)‘𝑐) = 𝑏 → 𝑏 ⊆ (TC‘𝑎))
35	29, 34	sylbi 220	. . . . 5 ⊢ (𝑏 ∈ ran (𝑈‘𝑎) → 𝑏 ⊆ (TC‘𝑎))
36	27, 35	mprgbir 3121	. . . 4 ⊢ ∪ ran (𝑈‘𝑎) ⊆ (TC‘𝑎)
37	26, 36	eqssi 3931	. . 3 ⊢ (TC‘𝑎) = ∪ ran (𝑈‘𝑎)
38	5, 37	vtoclg 3515	. 2 ⊢ (𝐴 ∈ V → (TC‘𝐴) = ∪ ran (𝑈‘𝐴))
39		rn0 5760	. . . . 5 ⊢ ran ∅ = ∅
40	39	unieqi 4813	. . . 4 ⊢ ∪ ran ∅ = ∪ ∅
41		uni0 4828	. . . 4 ⊢ ∪ ∅ = ∅
42	40, 41	eqtr2i 2822	. . 3 ⊢ ∅ = ∪ ran ∅
43		fvprc 6638	. . 3 ⊢ (¬ 𝐴 ∈ V → (TC‘𝐴) = ∅)
44		fvprc 6638	. . . . 5 ⊢ (¬ 𝐴 ∈ V → (𝑈‘𝐴) = ∅)
45	44	rneqd 5772	. . . 4 ⊢ (¬ 𝐴 ∈ V → ran (𝑈‘𝐴) = ran ∅)
46	45	unieqd 4814	. . 3 ⊢ (¬ 𝐴 ∈ V → ∪ ran (𝑈‘𝐴) = ∪ ran ∅)
47	42, 43, 46	3eqtr4a 2859	. 2 ⊢ (¬ 𝐴 ∈ V → (TC‘𝐴) = ∪ ran (𝑈‘𝐴))
48	38, 47	pm2.61i 185	1 ⊢ (TC‘𝐴) = ∪ ran (𝑈‘𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∃wrex 3107  Vcvv 3441   ⊆ wss 3881  ∅c0 4243  ∪ cuni 4800   ↦ cmpt 5110  Tr wtr 5136  ran crn 5520   ↾ cres 5521  suc csuc 6161   Fn wfn 6319  ‘cfv 6324  ωcom 7560  reccrdg 8028  TCctc 9162

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-inf2 9088

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-om 7561  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-tc 9163

This theorem is referenced by:  hsmexlem5  9841