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

Theorem itunitc1 10425
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 6882 . . . . 5 (𝑎 = 𝐴 → (𝑈𝑎) = (𝑈𝐴))
21fveq1d 6884 . . . 4 (𝑎 = 𝐴 → ((𝑈𝑎)‘𝐵) = ((𝑈𝐴)‘𝐵))
3 fveq2 6882 . . . 4 (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
42, 3sseq12d 3967 . . 3 (𝑎 = 𝐴 → (((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎) ↔ ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)))
5 fveq2 6882 . . . . . 6 (𝑏 = ∅ → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘∅))
65sseq1d 3965 . . . . 5 (𝑏 = ∅ → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎)))
7 fveq2 6882 . . . . . 6 (𝑏 = 𝑐 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘𝑐))
87sseq1d 3965 . . . . 5 (𝑏 = 𝑐 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎)))
9 fveq2 6882 . . . . . 6 (𝑏 = suc 𝑐 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘suc 𝑐))
109sseq1d 3965 . . . . 5 (𝑏 = suc 𝑐 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎)))
11 fveq2 6882 . . . . . 6 (𝑏 = 𝐵 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘𝐵))
1211sseq1d 3965 . . . . 5 (𝑏 = 𝐵 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎)))
13 ituni.u . . . . . . . 8 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
1413ituni0 10423 . . . . . . 7 (𝑎 ∈ V → ((𝑈𝑎)‘∅) = 𝑎)
15 tcid 9719 . . . . . . 7 (𝑎 ∈ V → 𝑎 ⊆ (TC‘𝑎))
1614, 15eqsstrd 3968 . . . . . 6 (𝑎 ∈ V → ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎))
1716elv 3458 . . . . 5 ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎)
1813itunisuc 10424 . . . . . . 7 ((𝑈𝑎)‘suc 𝑐) = ((𝑈𝑎)‘𝑐)
19 tctr 9720 . . . . . . . . . 10 Tr (TC‘𝑎)
20 pwtr 5431 . . . . . . . . . 10 (Tr (TC‘𝑎) ↔ Tr 𝒫 (TC‘𝑎))
2119, 20mpbi 233 . . . . . . . . 9 Tr 𝒫 (TC‘𝑎)
22 trss 5226 . . . . . . . . 9 (Tr 𝒫 (TC‘𝑎) → (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎)))
2321, 22ax-mp 5 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎))
24 fvex 6895 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ∈ V
2524elpw 4564 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
26 sspwuni 5064 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
2723, 25, 263imtr3i 294 . . . . . . 7 (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
2818, 27eqsstrid 3972 . . . . . 6 (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎))
2928a1i 11 . . . . 5 (𝑐 ∈ ω → (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎)))
306, 8, 10, 12, 17, 29finds 7896 . . . 4 (𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎))
31 vex 3457 . . . . . . . 8 𝑎 ∈ V
3213itunifn 10422 . . . . . . . 8 (𝑎 ∈ V → (𝑈𝑎) Fn ω)
33 fndm 6639 . . . . . . . 8 ((𝑈𝑎) Fn ω → dom (𝑈𝑎) = ω)
3431, 32, 33mp2b 10 . . . . . . 7 dom (𝑈𝑎) = ω
3534eleq2i 2854 . . . . . 6 (𝐵 ∈ dom (𝑈𝑎) ↔ 𝐵 ∈ ω)
36 ndmfv 6914 . . . . . 6 𝐵 ∈ dom (𝑈𝑎) → ((𝑈𝑎)‘𝐵) = ∅)
3735, 36sylnbir 334 . . . . 5 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) = ∅)
38 0ss 4353 . . . . 5 ∅ ⊆ (TC‘𝑎)
3937, 38eqsstrdi 3978 . . . 4 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎))
4030, 39pm2.61i 184 . . 3 ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎)
414, 40vtoclg 3520 . 2 (𝐴 ∈ V → ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴))
42 fv2prc 6924 . . 3 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) = ∅)
43 0ss 4353 . . 3 ∅ ⊆ (TC‘𝐴)
4442, 43eqsstrdi 3978 . 2 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴))
4541, 44pm2.61i 184 1 ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4   = wceq 1570  wcel 2145  Vcvv 3453  wss 3902  c0 4282  𝒫 cpw 4560   cuni 4870  cmpt 5190  Tr wtr 5216  dom cdm 5659  cres 5661  suc csuc 6363   Fn wfn 6532  cfv 6537  ωcom 7865  reccrdg 8401  TCctc 9716
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739  ax-inf2 9623
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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-om 7866  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-tc 9717
This theorem is used by:  itunitc  10426
  Copyright terms: Public domain W3C validator