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

Theorem trclfvg 14355
Description: The value of the transitive closure of a relation is a superset or (for proper classes) the empty set. (Contributed by RP, 8-May-2020.)
Assertion
Ref Expression
trclfvg (𝑅 ⊆ (t+‘𝑅) ∨ (t+‘𝑅) = ∅)

Proof of Theorem trclfvg
StepHypRef Expression
1 exmid 891 . 2 (𝑅 ∈ V ∨ ¬ 𝑅 ∈ V)
2 trclfvlb 14348 . . 3 (𝑅 ∈ V → 𝑅 ⊆ (t+‘𝑅))
3 fvprc 6639 . . 3 𝑅 ∈ V → (t+‘𝑅) = ∅)
42, 3orim12i 905 . 2 ((𝑅 ∈ V ∨ ¬ 𝑅 ∈ V) → (𝑅 ⊆ (t+‘𝑅) ∨ (t+‘𝑅) = ∅))
51, 4ax-mp 5 1 (𝑅 ⊆ (t+‘𝑅) ∨ (t+‘𝑅) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wo 843   = wceq 1537  wcel 2114  Vcvv 3473  wss 3913  c0 4269  cfv 6331  t+ctcl 14325
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-sep 5179  ax-nul 5186  ax-pow 5242  ax-pr 5306  ax-un 7439
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ne 3007  df-ral 3130  df-rex 3131  df-rab 3134  df-v 3475  df-sbc 3753  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4270  df-if 4444  df-pw 4517  df-sn 4544  df-pr 4546  df-op 4550  df-uni 4815  df-int 4853  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5436  df-xp 5537  df-rel 5538  df-cnv 5539  df-co 5540  df-dm 5541  df-rn 5542  df-res 5543  df-iota 6290  df-fun 6333  df-fv 6339  df-trcl 14327
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator