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

Theorem itunitc1 9186
Description: Each union iterate is a member of the transitive closure. (Contributed by Stefan O'Rear, 11-Feb-2015.)
Hypothesis
Ref Expression
ituni.u 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
Assertion
Ref Expression
itunitc1 ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦
Allowed substitution hints:   𝑈(𝑥,𝑦)

Proof of Theorem itunitc1
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6148 . . . . 5 (𝑎 = 𝐴 → (𝑈𝑎) = (𝑈𝐴))
21fveq1d 6150 . . . 4 (𝑎 = 𝐴 → ((𝑈𝑎)‘𝐵) = ((𝑈𝐴)‘𝐵))
3 fveq2 6148 . . . 4 (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
42, 3sseq12d 3613 . . 3 (𝑎 = 𝐴 → (((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎) ↔ ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)))
5 fveq2 6148 . . . . . 6 (𝑏 = ∅ → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘∅))
65sseq1d 3611 . . . . 5 (𝑏 = ∅ → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎)))
7 fveq2 6148 . . . . . 6 (𝑏 = 𝑐 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘𝑐))
87sseq1d 3611 . . . . 5 (𝑏 = 𝑐 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎)))
9 fveq2 6148 . . . . . 6 (𝑏 = suc 𝑐 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘suc 𝑐))
109sseq1d 3611 . . . . 5 (𝑏 = suc 𝑐 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎)))
11 fveq2 6148 . . . . . 6 (𝑏 = 𝐵 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘𝐵))
1211sseq1d 3611 . . . . 5 (𝑏 = 𝐵 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎)))
13 vex 3189 . . . . . 6 𝑎 ∈ V
14 ituni.u . . . . . . . 8 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
1514ituni0 9184 . . . . . . 7 (𝑎 ∈ V → ((𝑈𝑎)‘∅) = 𝑎)
16 tcid 8559 . . . . . . 7 (𝑎 ∈ V → 𝑎 ⊆ (TC‘𝑎))
1715, 16eqsstrd 3618 . . . . . 6 (𝑎 ∈ V → ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎))
1813, 17ax-mp 5 . . . . 5 ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎)
1914itunisuc 9185 . . . . . . 7 ((𝑈𝑎)‘suc 𝑐) = ((𝑈𝑎)‘𝑐)
20 tctr 8560 . . . . . . . . . 10 Tr (TC‘𝑎)
21 pwtr 4882 . . . . . . . . . 10 (Tr (TC‘𝑎) ↔ Tr 𝒫 (TC‘𝑎))
2220, 21mpbi 220 . . . . . . . . 9 Tr 𝒫 (TC‘𝑎)
23 trss 4721 . . . . . . . . 9 (Tr 𝒫 (TC‘𝑎) → (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎)))
2422, 23ax-mp 5 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎))
25 fvex 6158 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ∈ V
2625elpw 4136 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
27 sspwuni 4577 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
2824, 26, 273imtr3i 280 . . . . . . 7 (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
2919, 28syl5eqss 3628 . . . . . 6 (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎))
3029a1i 11 . . . . 5 (𝑐 ∈ ω → (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎)))
316, 8, 10, 12, 18, 30finds 7039 . . . 4 (𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎))
3214itunifn 9183 . . . . . . . 8 (𝑎 ∈ V → (𝑈𝑎) Fn ω)
33 fndm 5948 . . . . . . . 8 ((𝑈𝑎) Fn ω → dom (𝑈𝑎) = ω)
3413, 32, 33mp2b 10 . . . . . . 7 dom (𝑈𝑎) = ω
3534eleq2i 2690 . . . . . 6 (𝐵 ∈ dom (𝑈𝑎) ↔ 𝐵 ∈ ω)
36 ndmfv 6175 . . . . . 6 𝐵 ∈ dom (𝑈𝑎) → ((𝑈𝑎)‘𝐵) = ∅)
3735, 36sylnbir 321 . . . . 5 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) = ∅)
38 0ss 3944 . . . . 5 ∅ ⊆ (TC‘𝑎)
3937, 38syl6eqss 3634 . . . 4 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎))
4031, 39pm2.61i 176 . . 3 ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎)
414, 40vtoclg 3252 . 2 (𝐴 ∈ V → ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴))
42 fvprc 6142 . . . . 5 𝐴 ∈ V → (𝑈𝐴) = ∅)
4342fveq1d 6150 . . . 4 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) = (∅‘𝐵))
44 0fv 6184 . . . 4 (∅‘𝐵) = ∅
4543, 44syl6eq 2671 . . 3 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) = ∅)
46 0ss 3944 . . 3 ∅ ⊆ (TC‘𝐴)
4745, 46syl6eqss 3634 . 2 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴))
4841, 47pm2.61i 176 1 ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1480  wcel 1987  Vcvv 3186  wss 3555  c0 3891  𝒫 cpw 4130   cuni 4402  cmpt 4673  Tr wtr 4712  dom cdm 5074  cres 5076  suc csuc 5684   Fn wfn 5842  cfv 5847  ωcom 7012  reccrdg 7450  TCctc 8556
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4731  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902  ax-inf2 8482
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-pss 3571  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-tp 4153  df-op 4155  df-uni 4403  df-int 4441  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-tr 4713  df-eprel 4985  df-id 4989  df-po 4995  df-so 4996  df-fr 5033  df-we 5035  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-pred 5639  df-ord 5685  df-on 5686  df-lim 5687  df-suc 5688  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-om 7013  df-wrecs 7352  df-recs 7413  df-rdg 7451  df-tc 8557
This theorem is referenced by:  itunitc  9187
  Copyright terms: Public domain W3C validator