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

Theorem itunitc1 9836
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 6664 . . . . 5 (𝑎 = 𝐴 → (𝑈𝑎) = (𝑈𝐴))
21fveq1d 6666 . . . 4 (𝑎 = 𝐴 → ((𝑈𝑎)‘𝐵) = ((𝑈𝐴)‘𝐵))
3 fveq2 6664 . . . 4 (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
42, 3sseq12d 3999 . . 3 (𝑎 = 𝐴 → (((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎) ↔ ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)))
5 fveq2 6664 . . . . . 6 (𝑏 = ∅ → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘∅))
65sseq1d 3997 . . . . 5 (𝑏 = ∅ → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎)))
7 fveq2 6664 . . . . . 6 (𝑏 = 𝑐 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘𝑐))
87sseq1d 3997 . . . . 5 (𝑏 = 𝑐 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎)))
9 fveq2 6664 . . . . . 6 (𝑏 = suc 𝑐 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘suc 𝑐))
109sseq1d 3997 . . . . 5 (𝑏 = suc 𝑐 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎)))
11 fveq2 6664 . . . . . 6 (𝑏 = 𝐵 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘𝐵))
1211sseq1d 3997 . . . . 5 (𝑏 = 𝐵 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎)))
13 ituni.u . . . . . . . 8 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
1413ituni0 9834 . . . . . . 7 (𝑎 ∈ V → ((𝑈𝑎)‘∅) = 𝑎)
15 tcid 9175 . . . . . . 7 (𝑎 ∈ V → 𝑎 ⊆ (TC‘𝑎))
1614, 15eqsstrd 4004 . . . . . 6 (𝑎 ∈ V → ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎))
1716elv 3499 . . . . 5 ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎)
1813itunisuc 9835 . . . . . . 7 ((𝑈𝑎)‘suc 𝑐) = ((𝑈𝑎)‘𝑐)
19 tctr 9176 . . . . . . . . . 10 Tr (TC‘𝑎)
20 pwtr 5337 . . . . . . . . . 10 (Tr (TC‘𝑎) ↔ Tr 𝒫 (TC‘𝑎))
2119, 20mpbi 232 . . . . . . . . 9 Tr 𝒫 (TC‘𝑎)
22 trss 5173 . . . . . . . . 9 (Tr 𝒫 (TC‘𝑎) → (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎)))
2321, 22ax-mp 5 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎))
24 fvex 6677 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ∈ V
2524elpw 4545 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
26 sspwuni 5014 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
2723, 25, 263imtr3i 293 . . . . . . 7 (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
2818, 27eqsstrid 4014 . . . . . 6 (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎))
2928a1i 11 . . . . 5 (𝑐 ∈ ω → (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎)))
306, 8, 10, 12, 17, 29finds 7602 . . . 4 (𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎))
31 vex 3497 . . . . . . . 8 𝑎 ∈ V
3213itunifn 9833 . . . . . . . 8 (𝑎 ∈ V → (𝑈𝑎) Fn ω)
33 fndm 6449 . . . . . . . 8 ((𝑈𝑎) Fn ω → dom (𝑈𝑎) = ω)
3431, 32, 33mp2b 10 . . . . . . 7 dom (𝑈𝑎) = ω
3534eleq2i 2904 . . . . . 6 (𝐵 ∈ dom (𝑈𝑎) ↔ 𝐵 ∈ ω)
36 ndmfv 6694 . . . . . 6 𝐵 ∈ dom (𝑈𝑎) → ((𝑈𝑎)‘𝐵) = ∅)
3735, 36sylnbir 333 . . . . 5 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) = ∅)
38 0ss 4349 . . . . 5 ∅ ⊆ (TC‘𝑎)
3937, 38eqsstrdi 4020 . . . 4 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎))
4030, 39pm2.61i 184 . . 3 ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎)
414, 40vtoclg 3567 . 2 (𝐴 ∈ V → ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴))
42 fv2prc 6704 . . 3 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) = ∅)
43 0ss 4349 . . 3 ∅ ⊆ (TC‘𝐴)
4442, 43eqsstrdi 4020 . 2 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴))
4541, 44pm2.61i 184 1 ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1533  wcel 2110  Vcvv 3494  wss 3935  c0 4290  𝒫 cpw 4538   cuni 4831  cmpt 5138  Tr wtr 5164  dom cdm 5549  cres 5551  suc csuc 6187   Fn wfn 6344  cfv 6349  ωcom 7574  reccrdg 8039  TCctc 9172
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455  ax-inf2 9098
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-int 4869  df-iun 4913  df-iin 4914  df-br 5059  df-opab 5121  df-mpt 5139  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-om 7575  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-tc 9173
This theorem is referenced by:  itunitc  9837
  Copyright terms: Public domain W3C validator