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

Theorem brcosscnv2 38001
Description: 𝐴 and 𝐵 are cosets by converse 𝑅: a binary relation. (Contributed by Peter Mazsa, 12-Mar-2019.)
Assertion
Ref Expression
brcosscnv2 ((𝐴𝑉𝐵𝑊) → (𝐴𝑅𝐵 ↔ ([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅))

Proof of Theorem brcosscnv2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 brcosscnv 38000 . 2 ((𝐴𝑉𝐵𝑊) → (𝐴𝑅𝐵 ↔ ∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥)))
2 ecinn0 37881 . 2 ((𝐴𝑉𝐵𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥)))
31, 2bitr4d 281 1 ((𝐴𝑉𝐵𝑊) → (𝐴𝑅𝐵 ↔ ([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  wex 1773  wcel 2098  wne 2930  cin 3938  c0 4318   class class class wbr 5143  ccnv 5671  [cec 8721  ccoss 37705
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696  ax-sep 5294  ax-nul 5301  ax-pr 5423
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ne 2931  df-ral 3052  df-rex 3061  df-rab 3420  df-v 3465  df-dif 3942  df-un 3944  df-in 3946  df-ss 3956  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-br 5144  df-opab 5206  df-xp 5678  df-cnv 5680  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-ec 8725  df-coss 37939
This theorem is referenced by:  br1cosscnvxrn  38002
  Copyright terms: Public domain W3C validator