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

Theorem itunitc 10335
Description: The union of all union iterates creates the transitive closure; compare trcl 9641. (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 6835 . . . 4 (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
2 fveq2 6835 . . . . . 6 (𝑎 = 𝐴 → (𝑈𝑎) = (𝑈𝐴))
32rneqd 5888 . . . . 5 (𝑎 = 𝐴 → ran (𝑈𝑎) = ran (𝑈𝐴))
43unieqd 4877 . . . 4 (𝑎 = 𝐴 ran (𝑈𝑎) = ran (𝑈𝐴))
51, 4eqeq12d 2753 . . 3 (𝑎 = 𝐴 → ((TC‘𝑎) = ran (𝑈𝑎) ↔ (TC‘𝐴) = ran (𝑈𝐴)))
6 ituni.u . . . . . . . 8 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
76ituni0 10332 . . . . . . 7 (𝑎 ∈ V → ((𝑈𝑎)‘∅) = 𝑎)
87elv 3446 . . . . . 6 ((𝑈𝑎)‘∅) = 𝑎
9 fvssunirn 6866 . . . . . 6 ((𝑈𝑎)‘∅) ⊆ ran (𝑈𝑎)
108, 9eqsstrri 3982 . . . . 5 𝑎 ran (𝑈𝑎)
11 dftr3 5211 . . . . . 6 (Tr ran (𝑈𝑎) ↔ ∀𝑏 ran (𝑈𝑎)𝑏 ran (𝑈𝑎))
12 vex 3445 . . . . . . . 8 𝑎 ∈ V
136itunifn 10331 . . . . . . . 8 (𝑎 ∈ V → (𝑈𝑎) Fn ω)
14 fnunirn 7201 . . . . . . . 8 ((𝑈𝑎) Fn ω → (𝑏 ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈𝑎)‘𝑐)))
1512, 13, 14mp2b 10 . . . . . . 7 (𝑏 ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈𝑎)‘𝑐))
16 elssuni 4895 . . . . . . . . 9 (𝑏 ∈ ((𝑈𝑎)‘𝑐) → 𝑏 ((𝑈𝑎)‘𝑐))
176itunisuc 10333 . . . . . . . . . 10 ((𝑈𝑎)‘suc 𝑐) = ((𝑈𝑎)‘𝑐)
18 fvssunirn 6866 . . . . . . . . . 10 ((𝑈𝑎)‘suc 𝑐) ⊆ ran (𝑈𝑎)
1917, 18eqsstrri 3982 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ⊆ ran (𝑈𝑎)
2016, 19sstrdi 3947 . . . . . . . 8 (𝑏 ∈ ((𝑈𝑎)‘𝑐) → 𝑏 ran (𝑈𝑎))
2120rexlimivw 3134 . . . . . . 7 (∃𝑐 ∈ ω 𝑏 ∈ ((𝑈𝑎)‘𝑐) → 𝑏 ran (𝑈𝑎))
2215, 21sylbi 217 . . . . . 6 (𝑏 ran (𝑈𝑎) → 𝑏 ran (𝑈𝑎))
2311, 22mprgbir 3059 . . . . 5 Tr ran (𝑈𝑎)
24 tcmin 9652 . . . . . 6 (𝑎 ∈ V → ((𝑎 ran (𝑈𝑎) ∧ Tr ran (𝑈𝑎)) → (TC‘𝑎) ⊆ ran (𝑈𝑎)))
2524elv 3446 . . . . 5 ((𝑎 ran (𝑈𝑎) ∧ Tr ran (𝑈𝑎)) → (TC‘𝑎) ⊆ ran (𝑈𝑎))
2610, 23, 25mp2an 693 . . . 4 (TC‘𝑎) ⊆ ran (𝑈𝑎)
27 unissb 4897 . . . . 5 ( ran (𝑈𝑎) ⊆ (TC‘𝑎) ↔ ∀𝑏 ∈ ran (𝑈𝑎)𝑏 ⊆ (TC‘𝑎))
28 fvelrnb 6895 . . . . . . 7 ((𝑈𝑎) Fn ω → (𝑏 ∈ ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω ((𝑈𝑎)‘𝑐) = 𝑏))
2912, 13, 28mp2b 10 . . . . . 6 (𝑏 ∈ ran (𝑈𝑎) ↔ ∃𝑐 ∈ ω ((𝑈𝑎)‘𝑐) = 𝑏)
306itunitc1 10334 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎)
3130a1i 11 . . . . . . . 8 (𝑐 ∈ ω → ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
32 sseq1 3960 . . . . . . . 8 (((𝑈𝑎)‘𝑐) = 𝑏 → (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) ↔ 𝑏 ⊆ (TC‘𝑎)))
3331, 32syl5ibcom 245 . . . . . . 7 (𝑐 ∈ ω → (((𝑈𝑎)‘𝑐) = 𝑏𝑏 ⊆ (TC‘𝑎)))
3433rexlimiv 3131 . . . . . 6 (∃𝑐 ∈ ω ((𝑈𝑎)‘𝑐) = 𝑏𝑏 ⊆ (TC‘𝑎))
3529, 34sylbi 217 . . . . 5 (𝑏 ∈ ran (𝑈𝑎) → 𝑏 ⊆ (TC‘𝑎))
3627, 35mprgbir 3059 . . . 4 ran (𝑈𝑎) ⊆ (TC‘𝑎)
3726, 36eqssi 3951 . . 3 (TC‘𝑎) = ran (𝑈𝑎)
385, 37vtoclg 3512 . 2 (𝐴 ∈ V → (TC‘𝐴) = ran (𝑈𝐴))
39 rn0 5876 . . . . 5 ran ∅ = ∅
4039unieqi 4876 . . . 4 ran ∅ =
41 uni0 4892 . . . 4 ∅ = ∅
4240, 41eqtr2i 2761 . . 3 ∅ = ran ∅
43 fvprc 6827 . . 3 𝐴 ∈ V → (TC‘𝐴) = ∅)
44 fvprc 6827 . . . . 5 𝐴 ∈ V → (𝑈𝐴) = ∅)
4544rneqd 5888 . . . 4 𝐴 ∈ V → ran (𝑈𝐴) = ran ∅)
4645unieqd 4877 . . 3 𝐴 ∈ V → ran (𝑈𝐴) = ran ∅)
4742, 43, 463eqtr4a 2798 . 2 𝐴 ∈ V → (TC‘𝐴) = ran (𝑈𝐴))
4838, 47pm2.61i 182 1 (TC‘𝐴) = ran (𝑈𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wrex 3061  Vcvv 3441  wss 3902  c0 4286   cuni 4864  cmpt 5180  Tr wtr 5206  ran crn 5626  cres 5627  suc csuc 6320   Fn wfn 6488  cfv 6493  ωcom 7810  reccrdg 8342  TCctc 9647
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pr 5378  ax-un 7682  ax-inf2 9554
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-iin 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7363  df-om 7811  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-tc 9648
This theorem is referenced by:  hsmexlem5  10344
  Copyright terms: Public domain W3C validator