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

Theorem itunitc 10393
Description: The union of all union iterates creates the transitive closure; compare trcl 9685. (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 6871 . . . 4 (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
2 fveq2 6871 . . . . . 6 (𝑎 = 𝐴 → (𝑈𝑎) = (𝑈𝐴))
32rneqd 5919 . . . . 5 (𝑎 = 𝐴 → ran (𝑈𝑎) = ran (𝑈𝐴))
43unieqd 4881 . . . 4 (𝑎 = 𝐴 ran (𝑈𝑎) = ran (𝑈𝐴))
51, 4eqeq12d 2781 . . 3 (𝑎 = 𝐴 → ((TC‘𝑎) = ran (𝑈𝑎) ↔ (TC‘𝐴) = ran (𝑈𝐴)))
6 ituni.u . . . . . . . 8 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
76ituni0 10390 . . . . . . 7 (𝑎 ∈ V → ((𝑈𝑎)‘∅) = 𝑎)
87elv 3462 . . . . . 6 ((𝑈𝑎)‘∅) = 𝑎
9 fvssunirn 6902 . . . . . 6 ((𝑈𝑎)‘∅) ⊆ ran (𝑈𝑎)
108, 9eqsstrri 3986 . . . . 5 𝑎 ran (𝑈𝑎)
11 dftr3 5217 . . . . . 6 (Tr ran (𝑈𝑎) ↔ ∀𝑏 ran (𝑈𝑎)𝑏 ran (𝑈𝑎))
12 vex 3461 . . . . . . . 8 𝑎 ∈ V
136itunifn 10389 . . . . . . . 8 (𝑎 ∈ V → (𝑈𝑎) Fn ω)
14 fnunirn 7241 . . . . . . . 8 ((𝑈𝑎) Fn ω → (𝑏 ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈𝑎)‘𝑐)))
1512, 13, 14mp2b 10 . . . . . . 7 (𝑏 ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈𝑎)‘𝑐))
16 elssuni 4900 . . . . . . . . 9 (𝑏 ∈ ((𝑈𝑎)‘𝑐) → 𝑏 ((𝑈𝑎)‘𝑐))
176itunisuc 10391 . . . . . . . . . 10 ((𝑈𝑎)‘suc 𝑐) = ((𝑈𝑎)‘𝑐)
18 fvssunirn 6902 . . . . . . . . . 10 ((𝑈𝑎)‘suc 𝑐) ⊆ ran (𝑈𝑎)
1917, 18eqsstrri 3986 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ⊆ ran (𝑈𝑎)
2016, 19sstrdi 3951 . . . . . . . 8 (𝑏 ∈ ((𝑈𝑎)‘𝑐) → 𝑏 ran (𝑈𝑎))
2120rexlimivw 3162 . . . . . . 7 (∃𝑐 ∈ ω 𝑏 ∈ ((𝑈𝑎)‘𝑐) → 𝑏 ran (𝑈𝑎))
2215, 21sylbi 220 . . . . . 6 (𝑏 ran (𝑈𝑎) → 𝑏 ran (𝑈𝑎))
2311, 22mprgbir 3086 . . . . 5 Tr ran (𝑈𝑎)
24 tcmin 9696 . . . . . 6 (𝑎 ∈ V → ((𝑎 ran (𝑈𝑎) ∧ Tr ran (𝑈𝑎)) → (TC‘𝑎) ⊆ ran (𝑈𝑎)))
2524elv 3462 . . . . 5 ((𝑎 ran (𝑈𝑎) ∧ Tr ran (𝑈𝑎)) → (TC‘𝑎) ⊆ ran (𝑈𝑎))
2610, 23, 25mp2an 704 . . . 4 (TC‘𝑎) ⊆ ran (𝑈𝑎)
27 unissb 4902 . . . . 5 ( ran (𝑈𝑎) ⊆ (TC‘𝑎) ↔ ∀𝑏 ∈ ran (𝑈𝑎)𝑏 ⊆ (TC‘𝑎))
28 fvelrnb 6931 . . . . . . 7 ((𝑈𝑎) Fn ω → (𝑏 ∈ ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω ((𝑈𝑎)‘𝑐) = 𝑏))
2912, 13, 28mp2b 10 . . . . . 6 (𝑏 ∈ ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω ((𝑈𝑎)‘𝑐) = 𝑏)
306itunitc1 10392 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎)
3130a1i 11 . . . . . . . 8 (𝑐 ∈ ω → ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
32 sseq1 3964 . . . . . . . 8 (((𝑈𝑎)‘𝑐) = 𝑏 → (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) ↔ 𝑏 ⊆ (TC‘𝑎)))
3331, 32syl5ibcom 248 . . . . . . 7 (𝑐 ∈ ω → (((𝑈𝑎)‘𝑐) = 𝑏𝑏 ⊆ (TC‘𝑎)))
3433rexlimiv 3159 . . . . . 6 (∃𝑐 ∈ ω ((𝑈𝑎)‘𝑐) = 𝑏𝑏 ⊆ (TC‘𝑎))
3529, 34sylbi 220 . . . . 5 (𝑏 ∈ ran (𝑈𝑎) → 𝑏 ⊆ (TC‘𝑎))
3627, 35mprgbir 3086 . . . 4 ran (𝑈𝑎) ⊆ (TC‘𝑎)
3726, 36eqssi 3955 . . 3 (TC‘𝑎) = ran (𝑈𝑎)
385, 37vtoclg 3525 . 2 (𝐴 ∈ V → (TC‘𝐴) = ran (𝑈𝐴))
39 rn0 5907 . . . . 5 ran ∅ = ∅
4039unieqi 4880 . . . 4 ran ∅ =
41 uni0 4897 . . . 4 ∅ = ∅
4240, 41eqtr2i 2789 . . 3 ∅ = ran ∅
43 fvprc 6863 . . 3 𝐴 ∈ V → (TC‘𝐴) = ∅)
44 fvprc 6863 . . . . 5 𝐴 ∈ V → (𝑈𝐴) = ∅)
4544rneqd 5919 . . . 4 𝐴 ∈ V → ran (𝑈𝐴) = ran ∅)
4645unieqd 4881 . . 3 𝐴 ∈ V → ran (𝑈𝐴) = ran ∅)
4742, 43, 463eqtr4a 2826 . 2 𝐴 ∈ V → (TC‘𝐴) = ran (𝑈𝐴))
4838, 47pm2.61i 184 1 (TC‘𝐴) = ran (𝑈𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400   = wceq 1563  wcel 2145  wrex 3089  Vcvv 3457  wss 3907  c0 4288   cuni 4868  cmpt 5186  Tr wtr 5212  ran crn 5653  cres 5654  suc csuc 6352   Fn wfn 6520  cfv 6525  ωcom 7850  reccrdg 8384  TCctc 9691
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pr 5395  ax-un 7722  ax-inf2 9598
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-int 4909  df-iun 4954  df-iin 4955  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-ov 7403  df-om 7851  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-tc 9692
This theorem is referenced by:  hsmexlem5  10402
  Copyright terms: Public domain W3C validator