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

Theorem itunitc1 10380
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 6861 . . . . 5 (𝑎 = 𝐴 → (𝑈𝑎) = (𝑈𝐴))
21fveq1d 6863 . . . 4 (𝑎 = 𝐴 → ((𝑈𝑎)‘𝐵) = ((𝑈𝐴)‘𝐵))
3 fveq2 6861 . . . 4 (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
42, 3sseq12d 3983 . . 3 (𝑎 = 𝐴 → (((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎) ↔ ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)))
5 fveq2 6861 . . . . . 6 (𝑏 = ∅ → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘∅))
65sseq1d 3981 . . . . 5 (𝑏 = ∅ → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎)))
7 fveq2 6861 . . . . . 6 (𝑏 = 𝑐 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘𝑐))
87sseq1d 3981 . . . . 5 (𝑏 = 𝑐 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎)))
9 fveq2 6861 . . . . . 6 (𝑏 = suc 𝑐 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘suc 𝑐))
109sseq1d 3981 . . . . 5 (𝑏 = suc 𝑐 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎)))
11 fveq2 6861 . . . . . 6 (𝑏 = 𝐵 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘𝐵))
1211sseq1d 3981 . . . . 5 (𝑏 = 𝐵 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎)))
13 ituni.u . . . . . . . 8 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
1413ituni0 10378 . . . . . . 7 (𝑎 ∈ V → ((𝑈𝑎)‘∅) = 𝑎)
15 tcid 9699 . . . . . . 7 (𝑎 ∈ V → 𝑎 ⊆ (TC‘𝑎))
1614, 15eqsstrd 3984 . . . . . 6 (𝑎 ∈ V → ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎))
1716elv 3455 . . . . 5 ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎)
1813itunisuc 10379 . . . . . . 7 ((𝑈𝑎)‘suc 𝑐) = ((𝑈𝑎)‘𝑐)
19 tctr 9700 . . . . . . . . . 10 Tr (TC‘𝑎)
20 pwtr 5415 . . . . . . . . . 10 (Tr (TC‘𝑎) ↔ Tr 𝒫 (TC‘𝑎))
2119, 20mpbi 230 . . . . . . . . 9 Tr 𝒫 (TC‘𝑎)
22 trss 5228 . . . . . . . . 9 (Tr 𝒫 (TC‘𝑎) → (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎)))
2321, 22ax-mp 5 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎))
24 fvex 6874 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ∈ V
2524elpw 4570 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
26 sspwuni 5067 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
2723, 25, 263imtr3i 291 . . . . . . 7 (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
2818, 27eqsstrid 3988 . . . . . 6 (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎))
2928a1i 11 . . . . 5 (𝑐 ∈ ω → (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎)))
306, 8, 10, 12, 17, 29finds 7875 . . . 4 (𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎))
31 vex 3454 . . . . . . . 8 𝑎 ∈ V
3213itunifn 10377 . . . . . . . 8 (𝑎 ∈ V → (𝑈𝑎) Fn ω)
33 fndm 6624 . . . . . . . 8 ((𝑈𝑎) Fn ω → dom (𝑈𝑎) = ω)
3431, 32, 33mp2b 10 . . . . . . 7 dom (𝑈𝑎) = ω
3534eleq2i 2821 . . . . . 6 (𝐵 ∈ dom (𝑈𝑎) ↔ 𝐵 ∈ ω)
36 ndmfv 6896 . . . . . 6 𝐵 ∈ dom (𝑈𝑎) → ((𝑈𝑎)‘𝐵) = ∅)
3735, 36sylnbir 331 . . . . 5 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) = ∅)
38 0ss 4366 . . . . 5 ∅ ⊆ (TC‘𝑎)
3937, 38eqsstrdi 3994 . . . 4 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎))
4030, 39pm2.61i 182 . . 3 ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎)
414, 40vtoclg 3523 . 2 (𝐴 ∈ V → ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴))
42 fv2prc 6906 . . 3 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) = ∅)
43 0ss 4366 . . 3 ∅ ⊆ (TC‘𝐴)
4442, 43eqsstrdi 3994 . 2 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴))
4541, 44pm2.61i 182 1 ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1540  wcel 2109  Vcvv 3450  wss 3917  c0 4299  𝒫 cpw 4566   cuni 4874  cmpt 5191  Tr wtr 5217  dom cdm 5641  cres 5643  suc csuc 6337   Fn wfn 6509  cfv 6514  ωcom 7845  reccrdg 8380  TCctc 9696
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714  ax-inf2 9601
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4914  df-iun 4960  df-iin 4961  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-om 7846  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-tc 9697
This theorem is referenced by:  itunitc  10381
  Copyright terms: Public domain W3C validator