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

Theorem itunitc 10526
Description: The union of all union iterates creates the transitive closure; compare trcl 9756. (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 6908 . . . 4 (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
2 fveq2 6908 . . . . . 6 (𝑎 = 𝐴 → (𝑈‘𝑎) = (𝑈‘𝐴))
32rneqd 5927 . . . . 5 (𝑎 = 𝐴 → ran (𝑈‘𝑎) = ran (𝑈‘𝐴))
43unieqd 4883 . . . 4 (𝑎 = 𝐴 → ∪ ran (𝑈‘𝑎) = ∪ ran (𝑈‘𝐴))
51, 4eqeq12d 2779 . . 3 (𝑎 = 𝐴 → ((TC‘𝑎) = ∪ ran (𝑈‘𝑎) ↔ (TC‘𝐴) = ∪ ran (𝑈‘𝐴)))
6 ituni.u . . . . . . . 8 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ ∪ 𝑦), 𝑥) ↾ ω))
76ituni0 10523 . . . . . . 7 (𝑎 ∈ V → ((𝑈‘𝑎)‘∅) = 𝑎)
87elv 3459 . . . . . 6 ((𝑈‘𝑎)‘∅) = 𝑎
9 fvssunirn 6939 . . . . . 6 ((𝑈‘𝑎)‘∅) ⊆ ∪ ran (𝑈‘𝑎)
108, 9eqsstrri 3960 . . . . 5 𝑎 ⊆ ∪ ran (𝑈‘𝑎)
11 dftr3 5220 . . . . . 6 (Tr ∪ ran (𝑈‘𝑎) ↔ ∀𝑏 ∈ ∪ ran (𝑈‘𝑎)𝑏 ⊆ ∪ ran (𝑈‘𝑎))
12 vex 3458 . . . . . . . 8 𝑎 ∈ V
136itunifn 10522 . . . . . . . 8 (𝑎 ∈ V → (𝑈‘𝑎) Fn ω)
14 fnunirn 7280 . . . . . . . 8 ((𝑈‘𝑎) Fn ω → (𝑏 ∈ ∪ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈‘𝑎)‘𝑐)))
1512, 13, 14mp2b 10 . . . . . . 7 (𝑏 ∈ ∪ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω 𝑏 ∈ ((𝑈‘𝑎)‘𝑐))
16 elssuni 4902 . . . . . . . . 9 (𝑏 ∈ ((𝑈‘𝑎)‘𝑐) → 𝑏 ⊆ ∪ ((𝑈‘𝑎)‘𝑐))
176itunisuc 10524 . . . . . . . . . 10 ((𝑈‘𝑎)‘suc 𝑐) = ∪ ((𝑈‘𝑎)‘𝑐)
18 fvssunirn 6939 . . . . . . . . . 10 ((𝑈‘𝑎)‘suc 𝑐) ⊆ ∪ ran (𝑈‘𝑎)
1917, 18eqsstrri 3960 . . . . . . . . 9 ∪ ((𝑈‘𝑎)‘𝑐) ⊆ ∪ ran (𝑈‘𝑎)
2016, 19sstrdi 3925 . . . . . . . 8 (𝑏 ∈ ((𝑈‘𝑎)‘𝑐) → 𝑏 ⊆ ∪ ran (𝑈‘𝑎))
2120rexlimivw 3163 . . . . . . 7 (∃𝑐 ∈ ω 𝑏 ∈ ((𝑈‘𝑎)‘𝑐) → 𝑏 ⊆ ∪ ran (𝑈‘𝑎))
2215, 21sylbi 220 . . . . . 6 (𝑏 ∈ ∪ ran (𝑈‘𝑎) → 𝑏 ⊆ ∪ ran (𝑈‘𝑎))
2311, 22mprgbir 3087 . . . . 5 Tr ∪ ran (𝑈‘𝑎)
24 tcmin 9767 . . . . . 6 (𝑎 ∈ V → ((𝑎 ⊆ ∪ ran (𝑈‘𝑎) ∧ Tr ∪ ran (𝑈‘𝑎)) → (TC‘𝑎) ⊆ ∪ ran (𝑈‘𝑎)))
2524elv 3459 . . . . 5 ((𝑎 ⊆ ∪ ran (𝑈‘𝑎) ∧ Tr ∪ ran (𝑈‘𝑎)) → (TC‘𝑎) ⊆ ∪ ran (𝑈‘𝑎))
2610, 23, 25mp2an 705 . . . 4 (TC‘𝑎) ⊆ ∪ ran (𝑈‘𝑎)
27 unissb 4904 . . . . 5 (∪ ran (𝑈‘𝑎) ⊆ (TC‘𝑎) ↔ ∀𝑏 ∈ ran (𝑈‘𝑎)𝑏 ⊆ (TC‘𝑎))
28 fvelrnb 6968 . . . . . . 7 ((𝑈‘𝑎) Fn ω → (𝑏 ∈ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω ((𝑈‘𝑎)‘𝑐) = 𝑏))
2912, 13, 28mp2b 10 . . . . . 6 (𝑏 ∈ ran (𝑈‘𝑎) ↔ ∃𝑐 ∈ ω ((𝑈‘𝑎)‘𝑐) = 𝑏)
306itunitc1 10525 . . . . . . . . 9 ((𝑈‘𝑎)‘𝑐) ⊆ (TC‘𝑎)
3130a1i 11 . . . . . . . 8 (𝑐 ∈ ω → ((𝑈‘𝑎)‘𝑐) ⊆ (TC‘𝑎))
32 sseq1 3938 . . . . . . . 8 (((𝑈‘𝑎)‘𝑐) = 𝑏 → (((𝑈‘𝑎)‘𝑐) ⊆ (TC‘𝑎) ↔ 𝑏 ⊆ (TC‘𝑎)))
3331, 32syl5ibcom 248 . . . . . . 7 (𝑐 ∈ ω → (((𝑈‘𝑎)‘𝑐) = 𝑏 → 𝑏 ⊆ (TC‘𝑎)))
3433rexlimiv 3160 . . . . . 6 (∃𝑐 ∈ ω ((𝑈‘𝑎)‘𝑐) = 𝑏 → 𝑏 ⊆ (TC‘𝑎))
3529, 34sylbi 220 . . . . 5 (𝑏 ∈ ran (𝑈‘𝑎) → 𝑏 ⊆ (TC‘𝑎))
3627, 35mprgbir 3087 . . . 4 ∪ ran (𝑈‘𝑎) ⊆ (TC‘𝑎)
3726, 36eqssi 3929 . . 3 (TC‘𝑎) = ∪ ran (𝑈‘𝑎)
385, 37vtoclg 3521 . 2 (𝐴 ∈ V → (TC‘𝐴) = ∪ ran (𝑈‘𝐴))
39 rn0 5915 . . . . 5 ran ∅ = ∅
4039unieqi 4882 . . . 4 ∪ ran ∅ = ∪ ∅
41 uni0 4899 . . . 4 ∪ ∅ = ∅
4240, 41eqtr2i 2787 . . 3 ∅ = ∪ ran ∅
43 fvprc 6900 . . 3 (¬ 𝐴 ∈ V → (TC‘𝐴) = ∅)
44 fvprc 6900 . . . . 5 (¬ 𝐴 ∈ V → (𝑈‘𝐴) = ∅)
4544rneqd 5927 . . . 4 (¬ 𝐴 ∈ V → ran (𝑈‘𝐴) = ran ∅)
4645unieqd 4883 . . 3 (¬ 𝐴 ∈ V → ∪ ran (𝑈‘𝐴) = ∪ ran ∅)
4742, 43, 463eqtr4a 2824 . 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 1570   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  ∪ cuni 4870   ↦ cmpt 5189  Tr wtr 5215  ran crn 5656   ↾ cres 5657  suc csuc 6382   Fn wfn 6553  ‘cfv 6558  ωcom 7901  reccrdg 8445  TCctc 9762
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7775  ax-inf2 9669
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-om 7902  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-tc 9763
This theorem is used by:  hsmexlem5  10535
  Copyright terms: Public domain W3C validator