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 44881
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 4179 . 2 𝐴 ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴))
2 coundir 6268 . . . 4 ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) = ((𝐴 ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ∪ ((dom 𝐴 × ran 𝐴) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))))
3 coundi 6267 . . . . . 6 (𝐴 ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) = ((𝐴 ∘ 𝐴) ∪ (𝐴 ∘ (dom 𝐴 × ran 𝐴)))
4 cossxp 6298 . . . . . . 7 (𝐴 ∘ 𝐴) ⊆ (dom 𝐴 × ran 𝐴)
5 cossxp 6298 . . . . . . . 8 (𝐴 ∘ (dom 𝐴 × ran 𝐴)) ⊆ (dom (dom 𝐴 × ran 𝐴) × ran 𝐴)
6 dmxpss 6181 . . . . . . . . 9 dom (dom 𝐴 × ran 𝐴) ⊆ dom 𝐴
7 xpss1 5677 . . . . . . . . 9 (dom (dom 𝐴 × ran 𝐴) ⊆ dom 𝐴 → (dom (dom 𝐴 × ran 𝐴) × ran 𝐴) ⊆ (dom 𝐴 × ran 𝐴))
86, 7ax-mp 5 . . . . . . . 8 (dom (dom 𝐴 × ran 𝐴) × ran 𝐴) ⊆ (dom 𝐴 × ran 𝐴)
95, 8sstri 3922 . . . . . . 7 (𝐴 ∘ (dom 𝐴 × ran 𝐴)) ⊆ (dom 𝐴 × ran 𝐴)
104, 9unssi 4192 . . . . . 6 ((𝐴 ∘ 𝐴) ∪ (𝐴 ∘ (dom 𝐴 × ran 𝐴))) ⊆ (dom 𝐴 × ran 𝐴)
113, 10eqsstri 3959 . . . . 5 (𝐴 ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (dom 𝐴 × ran 𝐴)
12 coundi 6267 . . . . . 6 ((dom 𝐴 × ran 𝐴) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) = (((dom 𝐴 × ran 𝐴) ∘ 𝐴) ∪ ((dom 𝐴 × ran 𝐴) ∘ (dom 𝐴 × ran 𝐴)))
13 cossxp 6298 . . . . . . . 8 ((dom 𝐴 × ran 𝐴) ∘ 𝐴) ⊆ (dom 𝐴 × ran (dom 𝐴 × ran 𝐴))
14 rnxpss 6182 . . . . . . . . 9 ran (dom 𝐴 × ran 𝐴) ⊆ ran 𝐴
15 xpss2 5678 . . . . . . . . 9 (ran (dom 𝐴 × ran 𝐴) ⊆ ran 𝐴 → (dom 𝐴 × ran (dom 𝐴 × ran 𝐴)) ⊆ (dom 𝐴 × ran 𝐴))
1614, 15ax-mp 5 . . . . . . . 8 (dom 𝐴 × ran (dom 𝐴 × ran 𝐴)) ⊆ (dom 𝐴 × ran 𝐴)
1713, 16sstri 3922 . . . . . . 7 ((dom 𝐴 × ran 𝐴) ∘ 𝐴) ⊆ (dom 𝐴 × ran 𝐴)
18 xptrrel 15176 . . . . . . 7 ((dom 𝐴 × ran 𝐴) ∘ (dom 𝐴 × ran 𝐴)) ⊆ (dom 𝐴 × ran 𝐴)
1917, 18unssi 4192 . . . . . 6 (((dom 𝐴 × ran 𝐴) ∘ 𝐴) ∪ ((dom 𝐴 × ran 𝐴) ∘ (dom 𝐴 × ran 𝐴))) ⊆ (dom 𝐴 × ran 𝐴)
2012, 19eqsstri 3959 . . . . 5 ((dom 𝐴 × ran 𝐴) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (dom 𝐴 × ran 𝐴)
2111, 20unssi 4192 . . . 4 ((𝐴 ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ∪ ((dom 𝐴 × ran 𝐴) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴)))) ⊆ (dom 𝐴 × ran 𝐴)
222, 21eqsstri 3959 . . 3 ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (dom 𝐴 × ran 𝐴)
23 ssun2 4180 . . 3 (dom 𝐴 × ran 𝐴) ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴))
2422, 23sstri 3922 . 2 ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴))
25 trclexi.1 . . . . . 6 𝐴 ∈ 𝑉
2625elexi 3476 . . . . 5 𝐴 ∈ V
2726dmex 7955 . . . . . 6 dom 𝐴 ∈ V
2826rnex 7956 . . . . . 6 ran 𝐴 ∈ V
2927, 28xpex 7799 . . . . 5 (dom 𝐴 × ran 𝐴) ∈ V
3026, 29unex 7793 . . . 4 (𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∈ V
31 trcleq2lem 15187 . . . 4 (𝑥 = (𝐴 ∪ (dom 𝐴 × ran 𝐴)) → ((𝐴 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥) ↔ (𝐴 ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∧ ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴)))))
3230, 31spcev 3564 . . 3 ((𝐴 ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∧ ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) → ∃𝑥(𝐴 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥))
33 intexab 5314 . . 3 (∃𝑥(𝐴 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥) ↔ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ∈ V)
3432, 33sylib 221 . 2 ((𝐴 ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∧ ((𝐴 ∪ (dom 𝐴 × ran 𝐴)) ∘ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) ⊆ (𝐴 ∪ (dom 𝐴 × ran 𝐴))) → ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ∈ V)
351, 24, 34mp2an 705 1 ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ (𝑥 ∘ 𝑥) ⊆ 𝑥)} ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401  ∃wex 1812   ∈ wcel 2147  {cab 2741  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  ∩ cint 4912   × cxp 5656  dom cdm 5658  ran crn 5659   ∘ ccom 5662
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670
This theorem is used by:  dfrtrcl5  44890
  Copyright terms: Public domain W3C validator