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

Theorem eqvrelcoss4 39381
Description: Two ways to express equivalent cosets. (Contributed by Peter Mazsa, 3-May-2019.) (Revised by Peter Mazsa, 30-Sep-2021.)
Assertion
Ref Expression
eqvrelcoss4 ( EqvRel ≀ 𝑅 ↔ ∀𝑥𝑧(([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ → ([𝑥]𝑅 ∩ [𝑧]𝑅) ≠ ∅))
Distinct variable group:   𝑥,𝑅,𝑧

Proof of Theorem eqvrelcoss4
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eqvrelcoss3 39379 . 2 ( EqvRel ≀ 𝑅 ↔ ∀𝑥𝑦𝑧((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
2 trcoss2 39251 . 2 (∀𝑥𝑦𝑧((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧) ↔ ∀𝑥𝑧(([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ → ([𝑥]𝑅 ∩ [𝑧]𝑅) ≠ ∅))
31, 2bitri 278 1 ( EqvRel ≀ 𝑅 ↔ ∀𝑥𝑧(([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ → ([𝑥]𝑅 ∩ [𝑧]𝑅) ≠ ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400  wal 1567  wne 2957  cin 3903  c0 4285   class class class wbr 5108  ccnv 5659  [cec 8690  ccoss 38860   EqvRel weqvrel 38877
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-11 2191  ax-ext 2734  ax-sep 5256  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-ec 8694  df-coss 39178  df-refrel 39269  df-symrel 39301  df-trrel 39335  df-eqvrel 39346
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator