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

Theorem trclfvlb3 13746
Description: The transitive closure of a relation has a lower bound. (Contributed by RP, 8-May-2020.)
Assertion
Ref Expression
trclfvlb3 (𝑅𝑉 → (𝑅 ∪ (𝑅𝑅)) ⊆ (t+‘𝑅))

Proof of Theorem trclfvlb3
StepHypRef Expression
1 trclfvlb 13743 . 2 (𝑅𝑉𝑅 ⊆ (t+‘𝑅))
2 trclfvlb2 13745 . 2 (𝑅𝑉 → (𝑅𝑅) ⊆ (t+‘𝑅))
31, 2unssd 3787 1 (𝑅𝑉 → (𝑅 ∪ (𝑅𝑅)) ⊆ (t+‘𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 1989  cun 3570  wss 3572  ccom 5116  cfv 5886  t+ctcl 13718
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1721  ax-4 1736  ax-5 1838  ax-6 1887  ax-7 1934  ax-8 1991  ax-9 1998  ax-10 2018  ax-11 2033  ax-12 2046  ax-13 2245  ax-ext 2601  ax-sep 4779  ax-nul 4787  ax-pow 4841  ax-pr 4904  ax-un 6946
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1485  df-ex 1704  df-nf 1709  df-sb 1880  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2752  df-ne 2794  df-ral 2916  df-rex 2917  df-rab 2920  df-v 3200  df-sbc 3434  df-dif 3575  df-un 3577  df-in 3579  df-ss 3586  df-nul 3914  df-if 4085  df-pw 4158  df-sn 4176  df-pr 4178  df-op 4182  df-uni 4435  df-int 4474  df-br 4652  df-opab 4711  df-mpt 4728  df-id 5022  df-xp 5118  df-rel 5119  df-cnv 5120  df-co 5121  df-dm 5122  df-rn 5123  df-res 5124  df-iota 5849  df-fun 5888  df-fv 5894  df-trcl 13720
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator