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

Theorem trclubi 14921
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 6226 . . . . 5 (Rel 𝑅𝑅 ⊆ (dom 𝑅 × ran 𝑅))
3 ssequn1 4137 . . . . 5 (𝑅 ⊆ (dom 𝑅 × ran 𝑅) ↔ (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
42, 3sylib 218 . . . 4 (Rel 𝑅 → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅))
51, 4ax-mp 5 . . 3 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) = (dom 𝑅 × ran 𝑅)
6 trclubi.rex . . . 4 𝑅 ∈ V
7 trclublem 14920 . . . 4 (𝑅 ∈ V → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})
86, 7ax-mp 5 . . 3 (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}
95, 8eqeltrri 2832 . 2 (dom 𝑅 × ran 𝑅) ∈ {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)}
10 intss1 4917 . 2 ((dom 𝑅 × ran 𝑅) ∈ {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} → {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅))
119, 10ax-mp 5 1 {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ⊆ (dom 𝑅 × ran 𝑅)
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1542  wcel 2114  {cab 2713  Vcvv 3439  cun 3898  wss 3900   cint 4901   × cxp 5621  dom cdm 5623  ran crn 5624  ccom 5627  Rel wrel 5628
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2714  df-cleq 2727  df-clel 2810  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-int 4902  df-br 5098  df-opab 5160  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator