Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eqvrelcoss Structured version   Visualization version   GIF version

Theorem eqvrelcoss 39331
Description: Two ways to express equivalent cosets. (Contributed by Peter Mazsa, 4-Jul-2020.) (Revised by Peter Mazsa, 20-Dec-2021.)
Assertion
Ref Expression
eqvrelcoss ( EqvRel ≀ 𝑅 ↔ TrRel ≀ 𝑅)

Proof of Theorem eqvrelcoss
StepHypRef Expression
1 df-eqvrel 39299 . 2 ( EqvRel ≀ 𝑅 ↔ ( RefRel ≀ 𝑅 ∧ SymRel ≀ 𝑅 ∧ TrRel ≀ 𝑅))
2 refrelcoss 39233 . . 3 RefRel ≀ 𝑅
3 symrelcoss 39274 . . 3 SymRel ≀ 𝑅
42, 3triantru3 38866 . 2 ( TrRel ≀ 𝑅 ↔ ( RefRel ≀ 𝑅 ∧ SymRel ≀ 𝑅 ∧ TrRel ≀ 𝑅))
51, 4bitr4i 281 1 ( EqvRel ≀ 𝑅 ↔ TrRel ≀ 𝑅)
Colors of variables: wff setvar class
Syntax hints:  wb 209  w3a 1103  ccoss 38813   RefRel wrefrel 38819   SymRel wsymrel 38825   TrRel wtrrel 38828   EqvRel weqvrel 38830
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-11 2192  ax-ext 2735  ax-sep 5258  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-br 5111  df-opab 5175  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-coss 39131  df-refrel 39222  df-symrel 39254  df-eqvrel 39299
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator