MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  itunitc Structured version   Visualization version   GIF version

Theorem itunitc 10368
Description: The union of all union iterates creates the transitive closure; compare trcl 9673. (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.
StepHypRef Expression
1 fveq2 6856 . . . 4 (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
2 fveq2 6856 . . . . . 6 (𝑎 = 𝐴 → (𝑈𝑎) = (𝑈𝐴))
32rneqd 5907 . . . . 5 (𝑎 = 𝐴 → ran (𝑈𝑎) = ran (𝑈𝐴))
43unieqd 4872 . . . 4 (𝑎 = 𝐴 ran (𝑈𝑎) = ran (𝑈𝐴))
51, 4eqeq12d 2772 . . 3 (𝑎 = 𝐴 → ((TC‘𝑎) = ran (𝑈𝑎) ↔ (TC‘𝐴) = ran (𝑈𝐴)))
6 ituni.u . . . . . . . 8 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
76ituni0 10365 . . . . . . 7 (𝑎 ∈ V → ((𝑈𝑎)‘∅) = 𝑎)
87elv 3453 . . . . . 6 ((𝑈𝑎)‘∅) = 𝑎
9 fvssunirn 6887 . . . . . 6 ((𝑈𝑎)‘∅) ⊆ ran (𝑈𝑎)
108, 9eqsstrri 3978 . . . . 5 𝑎 ran (𝑈𝑎)
11 dftr3 5206 . . . . . 6 (Tr ran (𝑈𝑎) ↔ ∀𝑏 ran (𝑈𝑎)𝑏 ran (𝑈𝑎))
12 vex 3452 . . . . . . . 8 𝑎 ∈ V
136itunifn 10364 . . . . . . . 8 (𝑎 ∈ V → (𝑈𝑎) Fn ω)
14 fnunirn 7226 . . . . . . . 8 ((𝑈𝑎) Fn ω → (𝑏 ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈𝑎)‘𝑐)))
1512, 13, 14mp2b 10 . . . . . . 7 (𝑏 ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈𝑎)‘𝑐))
16 elssuni 4891 . . . . . . . . 9 (𝑏 ∈ ((𝑈𝑎)‘𝑐) → 𝑏 ((𝑈𝑎)‘𝑐))
176itunisuc 10366 . . . . . . . . . 10 ((𝑈𝑎)‘suc 𝑐) = ((𝑈𝑎)‘𝑐)
18 fvssunirn 6887 . . . . . . . . . 10 ((𝑈𝑎)‘suc 𝑐) ⊆ ran (𝑈𝑎)
1917, 18eqsstrri 3978 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ⊆ ran (𝑈𝑎)
2016, 19sstrdi 3943 . . . . . . . 8 (𝑏 ∈ ((𝑈𝑎)‘𝑐) → 𝑏 ran (𝑈𝑎))
2120rexlimivw 3153 . . . . . . 7 (∃𝑐 ∈ ω 𝑏 ∈ ((𝑈𝑎)‘𝑐) → 𝑏 ran (𝑈𝑎))
2215, 21sylbi 219 . . . . . 6 (𝑏 ran (𝑈𝑎) → 𝑏 ran (𝑈𝑎))
2311, 22mprgbir 3077 . . . . 5 Tr ran (𝑈𝑎)
24 tcmin 9684 . . . . . 6 (𝑎 ∈ V → ((𝑎 ran (𝑈𝑎) ∧ Tr ran (𝑈𝑎)) → (TC‘𝑎) ⊆ ran (𝑈𝑎)))
2524elv 3453 . . . . 5 ((𝑎 ran (𝑈𝑎) ∧ Tr ran (𝑈𝑎)) → (TC‘𝑎) ⊆ ran (𝑈𝑎))
2610, 23, 25mp2an 700 . . . 4 (TC‘𝑎) ⊆ ran (𝑈𝑎)
27 unissb 4893 . . . . 5 ( ran (𝑈𝑎) ⊆ (TC‘𝑎) ↔ ∀𝑏 ∈ ran (𝑈𝑎)𝑏 ⊆ (TC‘𝑎))
28 fvelrnb 6916 . . . . . . 7 ((𝑈𝑎) Fn ω → (𝑏 ∈ ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω ((𝑈𝑎)‘𝑐) = 𝑏))
2912, 13, 28mp2b 10 . . . . . 6 (𝑏 ∈ ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω ((𝑈𝑎)‘𝑐) = 𝑏)
306itunitc1 10367 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎)
3130a1i 11 . . . . . . . 8 (𝑐 ∈ ω → ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
32 sseq1 3956 . . . . . . . 8 (((𝑈𝑎)‘𝑐) = 𝑏 → (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) ↔ 𝑏 ⊆ (TC‘𝑎)))
3331, 32syl5ibcom 247 . . . . . . 7 (𝑐 ∈ ω → (((𝑈𝑎)‘𝑐) = 𝑏𝑏 ⊆ (TC‘𝑎)))
3433rexlimiv 3150 . . . . . 6 (∃𝑐 ∈ ω ((𝑈𝑎)‘𝑐) = 𝑏𝑏 ⊆ (TC‘𝑎))
3529, 34sylbi 219 . . . . 5 (𝑏 ∈ ran (𝑈𝑎) → 𝑏 ⊆ (TC‘𝑎))
3627, 35mprgbir 3077 . . . 4 ran (𝑈𝑎) ⊆ (TC‘𝑎)
3726, 36eqssi 3947 . . 3 (TC‘𝑎) = ran (𝑈𝑎)
385, 37vtoclg 3516 . 2 (𝐴 ∈ V → (TC‘𝐴) = ran (𝑈𝐴))
39 rn0 5895 . . . . 5 ran ∅ = ∅
4039unieqi 4871 . . . 4 ran ∅ =
41 uni0 4888 . . . 4 ∅ = ∅
4240, 41eqtr2i 2780 . . 3 ∅ = ran ∅
43 fvprc 6848 . . 3 𝐴 ∈ V → (TC‘𝐴) = ∅)
44 fvprc 6848 . . . . 5 𝐴 ∈ V → (𝑈𝐴) = ∅)
4544rneqd 5907 . . . 4 𝐴 ∈ V → ran (𝑈𝐴) = ran ∅)
4645unieqd 4872 . . 3 𝐴 ∈ V → ran (𝑈𝐴) = ran ∅)
4742, 43, 463eqtr4a 2817 . 2 𝐴 ∈ V → (TC‘𝐴) = ran (𝑈𝐴))
4838, 47pm2.61i 183 1 (TC‘𝐴) = ran (𝑈𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398   = wceq 1554  wcel 2136  wrex 3080  Vcvv 3448  wss 3899  c0 4280   cuni 4859  cmpt 5175  Tr wtr 5201  ran crn 5641  cres 5642  suc csuc 6337   Fn wfn 6505  cfv 6510  ωcom 7835  reccrdg 8368  TCctc 9679
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728  ax-rep 5221  ax-sep 5240  ax-nul 5250  ax-pr 5384  ax-un 7707  ax-inf2 9586
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ne 2952  df-ral 3071  df-rex 3081  df-reu 3362  df-rab 3409  df-v 3450  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-int 4900  df-iun 4945  df-iin 4946  df-br 5095  df-opab 5157  df-mpt 5176  df-tr 5202  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6466  df-fun 6512  df-fn 6513  df-f 6514  df-f1 6515  df-fo 6516  df-f1o 6517  df-fv 6518  df-ov 7388  df-om 7836  df-2nd 7960  df-frecs 8250  df-wrecs 8281  df-recs 8330  df-rdg 8369  df-tc 9680
This theorem is referenced by:  hsmexlem5  10377
  Copyright terms: Public domain W3C validator