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

Theorem trclubi 15116
Description: The Cartesian product of the domain and range of a relation is an upper bound for its transitive closure. (Contributed by RP, 2-Jan-2020.) (Revised by RP, 28-Apr-2020.) (Revised by AV, 26-Mar-2021.)
Hypotheses
Ref Expression
trclubi.rel Rel 𝑅
trclubi.rex 𝑅 ∈ V
Assertion
Ref Expression
trclubi {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅)
Distinct variable group:   𝑅,𝑠

Proof of Theorem trclubi
StepHypRef Expression
1 trclubi.rel . . . 4 Rel 𝑅
2 relssdmrn 6260 . . . . 5 (Rel 𝑅𝑅 ⊆ (dom 𝑅 × ran 𝑅))
3 ssequn1 4131 . . . . 5 (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
42, 3sylib 221 . . . 4 (Rel 𝑅 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
51, 4ax-mp 5 . . 3 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)
6 trclubi.rex . . . 4 𝑅 ∈ V
7 trclublem 15115 . . . 4 (𝑅 ∈ V → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})
86, 7ax-mp 5 . . 3 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}
95, 8eqeltrri 2857 . 2 (dom 𝑅 × ran 𝑅) ∈ {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}
10 intss1 4922 . 2 ((dom 𝑅 × ran 𝑅) ∈ {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} → {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅))
119, 10ax-mp 5 1 {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 401   = wceq 1570  wcel 2145  {cab 2738  Vcvv 3450  cun 3896  wss 3898   cint 4906   × cxp 5645  dom cdm 5647  ran crn 5648  ccom 5651  Rel wrel 5652
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-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7734
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-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator