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

Theorem itunitc 10500
Description: The union of all union iterates creates the transitive closure; compare trcl 9730. (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 6885 . . . 4 (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
2 fveq2 6885 . . . . . 6 (𝑎 = 𝐴 → (𝑈‘𝑎) = (𝑈‘𝐴))
32rneqd 5919 . . . . 5 (𝑎 = 𝐴 → ran (𝑈‘𝑎) = ran (𝑈‘𝐴))
43unieqd 4879 . . . 4 (𝑎 = 𝐴 → ∪ ran (𝑈‘𝑎) = ∪ ran (𝑈‘𝐴))
51, 4eqeq12d 2776 . . 3 (𝑎 = 𝐴 → ((TC‘𝑎) = ∪ ran (𝑈‘𝑎) ↔ (TC‘𝐴) = ∪ ran (𝑈‘𝐴)))
6 ituni.u . . . . . . . 8 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω))
76ituni0 10497 . . . . . . 7 (𝑎 ∈ V → ((𝑈‘𝑎)‘∅) = 𝑎)
87elv 3455 . . . . . 6 ((𝑈‘𝑎)‘∅) = 𝑎
9 fvssunirn 6916 . . . . . 6 ((𝑈‘𝑎)‘∅) ⊆ ∪ ran (𝑈‘𝑎)
108, 9eqsstrri 3955 . . . . 5 𝑎 ⊆ ∪ ran (𝑈‘𝑎)
11 dftr3 5216 . . . . . 6 (Tr ∪ ran (𝑈‘𝑎) ↔ ∀𝑏 ∈ ∪ ran (𝑈‘𝑎)𝑏 ⊆ ∪ ran (𝑈‘𝑎))
12 vex 3454 . . . . . . . 8 𝑎 ∈ V
136itunifn 10496 . . . . . . . 8 (𝑎 ∈ V → (𝑈‘𝑎) Fn ω)
14 fnunirn 7257 . . . . . . . 8 ((𝑈‘𝑎) Fn ω → (𝑏 ∈ ∪ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈‘𝑎)‘𝑐)))
1512, 13, 14mp2b 10 . . . . . . 7 (𝑏 ∈ ∪ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈‘𝑎)‘𝑐))
16 elssuni 4898 . . . . . . . . 9 (𝑏 ∈ ((𝑈‘𝑎)‘𝑐) → 𝑏 ⊆ ∪ ((𝑈‘𝑎)‘𝑐))
176itunisuc 10498 . . . . . . . . . 10 ((𝑈‘𝑎)‘suc 𝑐) = ∪ ((𝑈‘𝑎)‘𝑐)
18 fvssunirn 6916 . . . . . . . . . 10 ((𝑈‘𝑎)‘suc 𝑐) ⊆ ∪ ran (𝑈‘𝑎)
1917, 18eqsstrri 3955 . . . . . . . . 9 ∪ ((𝑈‘𝑎)‘𝑐) ⊆ ∪ ran (𝑈‘𝑎)
2016, 19sstrdi 3920 . . . . . . . 8 (𝑏 ∈ ((𝑈‘𝑎)‘𝑐) → 𝑏 ⊆ ∪ ran (𝑈‘𝑎))
2120rexlimivw 3159 . . . . . . 7 (∃𝑐 ∈ ω 𝑏 ∈ ((𝑈‘𝑎)‘𝑐) → 𝑏 ⊆ ∪ ran (𝑈‘𝑎))
2215, 21sylbi 220 . . . . . 6 (𝑏 ∈ ∪ ran (𝑈‘𝑎) → 𝑏 ⊆ ∪ ran (𝑈‘𝑎))
2311, 22mprgbir 3083 . . . . 5 Tr ∪ ran (𝑈‘𝑎)
24 tcmin 9741 . . . . . 6 (𝑎 ∈ V → ((𝑎 ⊆ ∪ ran (𝑈‘𝑎) ∧ Tr ∪ ran (𝑈‘𝑎)) → (TC‘𝑎) ⊆ ∪ ran (𝑈‘𝑎)))
2524elv 3455 . . . . 5 ((𝑎 ⊆ ∪ ran (𝑈‘𝑎) ∧ Tr ∪ ran (𝑈‘𝑎)) → (TC‘𝑎) ⊆ ∪ ran (𝑈‘𝑎))
2610, 23, 25mp2an 705 . . . 4 (TC‘𝑎) ⊆ ∪ ran (𝑈‘𝑎)
27 unissb 4900 . . . . 5 (∪ ran (𝑈‘𝑎) ⊆ (TC‘𝑎) ↔ ∀𝑏 ∈ ran (𝑈‘𝑎)𝑏 ⊆ (TC‘𝑎))
28 fvelrnb 6945 . . . . . . 7 ((𝑈‘𝑎) Fn ω → (𝑏 ∈ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω ((𝑈‘𝑎)‘𝑐) = 𝑏))
2912, 13, 28mp2b 10 . . . . . 6 (𝑏 ∈ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω ((𝑈‘𝑎)‘𝑐) = 𝑏)
306itunitc1 10499 . . . . . . . . 9 ((𝑈‘𝑎)‘𝑐) ⊆ (TC‘𝑎)
3130a1i 11 . . . . . . . 8 (𝑐 ∈ ω → ((𝑈‘𝑎)‘𝑐) ⊆ (TC‘𝑎))
32 sseq1 3933 . . . . . . . 8 (((𝑈‘𝑎)‘𝑐) = 𝑏 → (((𝑈‘𝑎)‘𝑐) ⊆ (TC‘𝑎) ↔ 𝑏 ⊆ (TC‘𝑎)))
3331, 32syl5ibcom 248 . . . . . . 7 (𝑐 ∈ ω → (((𝑈‘𝑎)‘𝑐) = 𝑏 → 𝑏 ⊆ (TC‘𝑎)))
3433rexlimiv 3156 . . . . . 6 (∃𝑐 ∈ ω ((𝑈‘𝑎)‘𝑐) = 𝑏 → 𝑏 ⊆ (TC‘𝑎))
3529, 34sylbi 220 . . . . 5 (𝑏 ∈ ran (𝑈‘𝑎) → 𝑏 ⊆ (TC‘𝑎))
3627, 35mprgbir 3083 . . . 4 ∪ ran (𝑈‘𝑎) ⊆ (TC‘𝑎)
3726, 36eqssi 3924 . . 3 (TC‘𝑎) = ∪ ran (𝑈‘𝑎)
385, 37vtoclg 3517 . 2 (𝐴 ∈ V → (TC‘𝐴) = ∪ ran (𝑈‘𝐴))
39 rn0 5907 . . . . 5 ran ∅ = ∅
4039unieqi 4878 . . . 4 ∪ ran ∅ = ∪ ∅
41 uni0 4895 . . . 4 ∪ ∅ = ∅
4240, 41eqtr2i 2784 . . 3 ∅ = ∪ ran ∅
43 fvprc 6877 . . 3 (¬ 𝐴 ∈ V → (TC‘𝐴) = ∅)
44 fvprc 6877 . . . . 5 (¬ 𝐴 ∈ V → (𝑈‘𝐴) = ∅)
4544rneqd 5919 . . . 4 (¬ 𝐴 ∈ V → ran (𝑈‘𝐴) = ran ∅)
4645unieqd 4879 . . 3 (¬ 𝐴 ∈ V → ∪ ran (𝑈‘𝐴) = ∪ ran ∅)
4742, 43, 463eqtr4a 2821 . 2 (¬ 𝐴 ∈ V → (TC‘𝐴) = ∪ ran (𝑈‘𝐴))
4838, 47pm2.61i 184 1 (TC‘𝐴) = ∪ ran (𝑈‘𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895  ∅c0 4278  ∪ cuni 4866   ↦ cmpt 5185  Tr wtr 5211  ran crn 5651   ↾ cres 5652  suc csuc 6364   Fn wfn 6533  ‘cfv 6538  ωcom 7877  reccrdg 8418  TCctc 9736
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751  ax-inf2 9643
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-om 7878  df-2nd 8002  df-frecs 8300  df-wrecs 8331  df-recs 8380  df-rdg 8419  df-tc 9737
This theorem is used by:  hsmexlem5  10509
  Copyright terms: Public domain W3C validator