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

Theorem trclubgi 14145
Description: The union with the Cartesian product of its domain and range is an upper bound for a set's transitive closure. (Contributed by RP, 3-Jan-2020.) (Revised by RP, 28-Apr-2020.) (Revised by AV, 26-Mar-2021.)
Hypothesis
Ref Expression
trclubgi.rex 𝑅 ∈ V
Assertion
Ref Expression
trclubgi {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
Distinct variable group:   𝑅,𝑠

Proof of Theorem trclubgi
StepHypRef Expression
1 trclubgi.rex . 2 𝑅 ∈ V
2 trclublem 14143 . 2 (𝑅 ∈ V → (𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)})
3 intss1 4725 . 2 ((𝑅 ∪ (dom 𝑅 × ran 𝑅)) ∈ {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} → {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅)))
41, 2, 3mp2b 10 1 {𝑠 ∣ (𝑅𝑠 ∧ (𝑠𝑠) ⊆ 𝑠)} ⊆ (𝑅 ∪ (dom 𝑅 × ran 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wa 386  wcel 2107  {cab 2763  Vcvv 3398  cun 3790  wss 3792   cint 4710   × cxp 5353  dom cdm 5355  ran crn 5356  ccom 5359
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-sep 5017  ax-nul 5025  ax-pow 5077  ax-pr 5138  ax-un 7226
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-ral 3095  df-rex 3096  df-rab 3099  df-v 3400  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-nul 4142  df-if 4308  df-pw 4381  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4672  df-int 4711  df-br 4887  df-opab 4949  df-xp 5361  df-rel 5362  df-cnv 5363  df-co 5364  df-dm 5365  df-rn 5366  df-res 5367
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator