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 36733
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 36731 . 2 ( EqvRel ≀ 𝑅 ↔ ∀𝑥𝑦𝑧((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧))
2 trcoss2 36602 . 2 (∀𝑥𝑦𝑧((𝑥𝑅𝑦𝑦𝑅𝑧) → 𝑥𝑅𝑧) ↔ ∀𝑥𝑧(([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ → ([𝑥]𝑅 ∩ [𝑧]𝑅) ≠ ∅))
31, 2bitri 274 1 ( EqvRel ≀ 𝑅 ↔ ∀𝑥𝑧(([𝑥] ≀ 𝑅 ∩ [𝑧] ≀ 𝑅) ≠ ∅ → ([𝑥]𝑅 ∩ [𝑧]𝑅) ≠ ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  wal 1537  wne 2943  cin 3886  c0 4256   class class class wbr 5074  ccnv 5588  [cec 8496  ccoss 36333   EqvRel weqvrel 36350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ec 8500  df-coss 36537  df-refrel 36630  df-symrel 36658  df-trrel 36688  df-eqvrel 36698
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator