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

Theorem itunitc1 9125
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 6103 . . . . 5 (𝑎 = 𝐴 → (𝑈𝑎) = (𝑈𝐴))
21fveq1d 6105 . . . 4 (𝑎 = 𝐴 → ((𝑈𝑎)‘𝐵) = ((𝑈𝐴)‘𝐵))
3 fveq2 6103 . . . 4 (𝑎 = 𝐴 → (TC‘𝑎) = (TC‘𝐴))
42, 3sseq12d 3597 . . 3 (𝑎 = 𝐴 → (((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎) ↔ ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)))
5 fveq2 6103 . . . . . 6 (𝑏 = ∅ → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘∅))
65sseq1d 3595 . . . . 5 (𝑏 = ∅ → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎)))
7 fveq2 6103 . . . . . 6 (𝑏 = 𝑐 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘𝑐))
87sseq1d 3595 . . . . 5 (𝑏 = 𝑐 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎)))
9 fveq2 6103 . . . . . 6 (𝑏 = suc 𝑐 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘suc 𝑐))
109sseq1d 3595 . . . . 5 (𝑏 = suc 𝑐 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎)))
11 fveq2 6103 . . . . . 6 (𝑏 = 𝐵 → ((𝑈𝑎)‘𝑏) = ((𝑈𝑎)‘𝐵))
1211sseq1d 3595 . . . . 5 (𝑏 = 𝐵 → (((𝑈𝑎)‘𝑏) ⊆ (TC‘𝑎) ↔ ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎)))
13 vex 3176 . . . . . 6 𝑎 ∈ V
14 ituni.u . . . . . . . 8 𝑈 = (𝑥 ∈ V ↦ (rec((𝑦 ∈ V ↦ 𝑦), 𝑥) ↾ ω))
1514ituni0 9123 . . . . . . 7 (𝑎 ∈ V → ((𝑈𝑎)‘∅) = 𝑎)
16 tcid 8498 . . . . . . 7 (𝑎 ∈ V → 𝑎 ⊆ (TC‘𝑎))
1715, 16eqsstrd 3602 . . . . . 6 (𝑎 ∈ V → ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎))
1813, 17ax-mp 5 . . . . 5 ((𝑈𝑎)‘∅) ⊆ (TC‘𝑎)
1914itunisuc 9124 . . . . . . 7 ((𝑈𝑎)‘suc 𝑐) = ((𝑈𝑎)‘𝑐)
20 tctr 8499 . . . . . . . . . 10 Tr (TC‘𝑎)
21 pwtr 4848 . . . . . . . . . 10 (Tr (TC‘𝑎) ↔ Tr 𝒫 (TC‘𝑎))
2220, 21mpbi 219 . . . . . . . . 9 Tr 𝒫 (TC‘𝑎)
23 trss 4689 . . . . . . . . 9 (Tr 𝒫 (TC‘𝑎) → (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎)))
2422, 23ax-mp 5 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎))
25 fvex 6113 . . . . . . . . 9 ((𝑈𝑎)‘𝑐) ∈ V
2625elpw 4114 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ∈ 𝒫 (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
27 sspwuni 4547 . . . . . . . 8 (((𝑈𝑎)‘𝑐) ⊆ 𝒫 (TC‘𝑎) ↔ ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
2824, 26, 273imtr3i 279 . . . . . . 7 (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎))
2919, 28syl5eqss 3612 . . . . . 6 (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎))
3029a1i 11 . . . . 5 (𝑐 ∈ ω → (((𝑈𝑎)‘𝑐) ⊆ (TC‘𝑎) → ((𝑈𝑎)‘suc 𝑐) ⊆ (TC‘𝑎)))
316, 8, 10, 12, 18, 30finds 6984 . . . 4 (𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎))
3214itunifn 9122 . . . . . . . 8 (𝑎 ∈ V → (𝑈𝑎) Fn ω)
33 fndm 5904 . . . . . . . 8 ((𝑈𝑎) Fn ω → dom (𝑈𝑎) = ω)
3413, 32, 33mp2b 10 . . . . . . 7 dom (𝑈𝑎) = ω
3534eleq2i 2680 . . . . . 6 (𝐵 ∈ dom (𝑈𝑎) ↔ 𝐵 ∈ ω)
36 ndmfv 6128 . . . . . 6 𝐵 ∈ dom (𝑈𝑎) → ((𝑈𝑎)‘𝐵) = ∅)
3735, 36sylnbir 320 . . . . 5 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) = ∅)
38 0ss 3924 . . . . 5 ∅ ⊆ (TC‘𝑎)
3937, 38syl6eqss 3618 . . . 4 𝐵 ∈ ω → ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎))
4031, 39pm2.61i 175 . . 3 ((𝑈𝑎)‘𝐵) ⊆ (TC‘𝑎)
414, 40vtoclg 3239 . 2 (𝐴 ∈ V → ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴))
42 fvprc 6097 . . . . 5 𝐴 ∈ V → (𝑈𝐴) = ∅)
4342fveq1d 6105 . . . 4 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) = (∅‘𝐵))
44 0fv 6137 . . . 4 (∅‘𝐵) = ∅
4543, 44syl6eq 2660 . . 3 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) = ∅)
46 0ss 3924 . . 3 ∅ ⊆ (TC‘𝐴)
4745, 46syl6eqss 3618 . 2 𝐴 ∈ V → ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴))
4841, 47pm2.61i 175 1 ((𝑈𝐴)‘𝐵) ⊆ (TC‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1475  wcel 1977  Vcvv 3173  wss 3540  c0 3874  𝒫 cpw 4108   cuni 4372  cmpt 4643  Tr wtr 4680  dom cdm 5038  cres 5040  suc csuc 5642   Fn wfn 5799  cfv 5804  ωcom 6957  reccrdg 7392  TCctc 8495
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-om 6958  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-tc 8496
This theorem is referenced by:  itunitc  9126
  Copyright terms: Public domain W3C validator