Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  trclexi Structured version   Visualization version   GIF version

Theorem trclexi 36946
Description: The transitive closure of a set exists. (Contributed by RP, 27-Oct-2020.)
Hypothesis
Ref Expression
trclexi.1 𝐴𝑉
Assertion
Ref Expression
trclexi {𝑥 ∣ (𝐴𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)} ∈ V
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem trclexi
StepHypRef Expression
1 ssun1 3738 . 2 𝐴 ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴))
2 coundir 5554 . . . 4 ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) = ((𝐴 ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ∪ ((dom 𝐴 × ran 𝐴) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))))
3 coundi 5553 . . . . . 6 (𝐴 ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) = ((𝐴𝐴) ∪ (𝐴 ∘ (dom 𝐴 × ran 𝐴)))
4 cossxp 5575 . . . . . . 7 (𝐴𝐴) ⊆ (dom 𝐴 × ran 𝐴)
5 cossxp 5575 . . . . . . . 8 (𝐴 ∘ (dom 𝐴 × ran 𝐴)) ⊆ (dom (dom 𝐴 × ran 𝐴) × ran 𝐴)
6 dmxpss 5484 . . . . . . . . 9 dom (dom 𝐴 × ran 𝐴) ⊆ dom 𝐴
7 xpss1 5151 . . . . . . . . 9 (dom (dom 𝐴 × ran 𝐴) ⊆ dom 𝐴 → (dom (dom 𝐴 × ran 𝐴) × ran 𝐴) ⊆ (dom 𝐴 × ran 𝐴))
86, 7ax-mp 5 . . . . . . . 8 (dom (dom 𝐴 × ran 𝐴) × ran 𝐴) ⊆ (dom 𝐴 × ran 𝐴)
95, 8sstri 3577 . . . . . . 7 (𝐴 ∘ (dom 𝐴 × ran 𝐴)) ⊆ (dom 𝐴 × ran 𝐴)
104, 9unssi 3750 . . . . . 6 ((𝐴𝐴) ∪ (𝐴 ∘ (dom 𝐴 × ran 𝐴))) ⊆ (dom 𝐴 × ran 𝐴)
113, 10eqsstri 3598 . . . . 5 (𝐴 ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (dom 𝐴 × ran 𝐴)
12 coundi 5553 . . . . . 6 ((dom 𝐴 × ran 𝐴) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) = (((dom 𝐴 × ran 𝐴) ∘ 𝐴) ∪ ((dom 𝐴 × ran 𝐴) ∘ (dom 𝐴 × ran 𝐴)))
13 cossxp 5575 . . . . . . . 8 ((dom 𝐴 × ran 𝐴) ∘ 𝐴) ⊆ (dom 𝐴 × ran (dom 𝐴 × ran 𝐴))
14 rnxpss 5485 . . . . . . . . 9 ran (dom 𝐴 × ran 𝐴) ⊆ ran 𝐴
15 xpss2 5152 . . . . . . . . 9 (ran (dom 𝐴 × ran 𝐴) ⊆ ran 𝐴 → (dom 𝐴 × ran (dom 𝐴 × ran 𝐴)) ⊆ (dom 𝐴 × ran 𝐴))
1614, 15ax-mp 5 . . . . . . . 8 (dom 𝐴 × ran (dom 𝐴 × ran 𝐴)) ⊆ (dom 𝐴 × ran 𝐴)
1713, 16sstri 3577 . . . . . . 7 ((dom 𝐴 × ran 𝐴) ∘ 𝐴) ⊆ (dom 𝐴 × ran 𝐴)
18 xptrrel 13567 . . . . . . 7 ((dom 𝐴 × ran 𝐴) ∘ (dom 𝐴 × ran 𝐴)) ⊆ (dom 𝐴 × ran 𝐴)
1917, 18unssi 3750 . . . . . 6 (((dom 𝐴 × ran 𝐴) ∘ 𝐴) ∪ ((dom 𝐴 × ran 𝐴) ∘ (dom 𝐴 × ran 𝐴))) ⊆ (dom 𝐴 × ran 𝐴)
2012, 19eqsstri 3598 . . . . 5 ((dom 𝐴 × ran 𝐴) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (dom 𝐴 × ran 𝐴)
2111, 20unssi 3750 . . . 4 ((𝐴 ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ∪ ((dom 𝐴 × ran 𝐴) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴)))) ⊆ (dom 𝐴 × ran 𝐴)
222, 21eqsstri 3598 . . 3 ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (dom 𝐴 × ran 𝐴)
23 ssun2 3739 . . 3 (dom 𝐴 × ran 𝐴) ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴))
2422, 23sstri 3577 . 2 ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴))
25 trclexi.1 . . . . . 6 𝐴𝑉
2625elexi 3186 . . . . 5 𝐴 ∈ V
2726dmex 6991 . . . . . 6 dom 𝐴 ∈ V
2826rnex 6992 . . . . . 6 ran 𝐴 ∈ V
2927, 28xpex 6860 . . . . 5 (dom 𝐴 × ran 𝐴) ∈ V
3026, 29unex 6854 . . . 4 (𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∈ V
31 trcleq2lem 13578 . . . 4 (𝑥 = (𝐴 ∪ (dom 𝐴 × ran 𝐴)) → ((𝐴𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) ↔ (𝐴 ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∧ ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴)))))
3230, 31spcev 3273 . . 3 ((𝐴 ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∧ ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) → ∃𝑥(𝐴𝑥 ∧ (𝑥𝑥) ⊆ 𝑥))
33 intexab 4749 . . 3 (∃𝑥(𝐴𝑥 ∧ (𝑥𝑥) ⊆ 𝑥) ↔ {𝑥 ∣ (𝐴𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)} ∈ V)
3432, 33sylib 207 . 2 ((𝐴 ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∧ ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) → {𝑥 ∣ (𝐴𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)} ∈ V)
351, 24, 34mp2an 704 1 {𝑥 ∣ (𝐴𝑥 ∧ (𝑥𝑥) ⊆ 𝑥)} ∈ V
Colors of variables: wff setvar class
Syntax hints:  wa 383  wex 1695  wcel 1977  {cab 2596  Vcvv 3173  cun 3538  wss 3540   cint 4410   × cxp 5036  dom cdm 5038  ran crn 5039  ccom 5042
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-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  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-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-int 4411  df-br 4584  df-opab 4644  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050
This theorem is referenced by:  dfrtrcl5  36955
  Copyright terms: Public domain W3C validator