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

Theorem ecinn0 38674
Description: Two ways of saying that the coset of 𝐴 and the coset of 𝐵 have some elements in common. (Contributed by Peter Mazsa, 23-Jan-2019.)
Assertion
Ref Expression
ecinn0 ((𝐴𝑉𝐵𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑅   𝑥,𝑉   𝑥,𝑊

Proof of Theorem ecinn0
StepHypRef Expression
1 ecin0 38673 . . 3 ((𝐴𝑉𝐵𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) = ∅ ↔ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥)))
21necon3abid 2968 . 2 ((𝐴𝑉𝐵𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ¬ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥)))
3 notnotb 315 . . . . 5 (𝐵𝑅𝑥 ↔ ¬ ¬ 𝐵𝑅𝑥)
43anbi2i 624 . . . 4 ((𝐴𝑅𝑥𝐵𝑅𝑥) ↔ (𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥))
54exbii 1850 . . 3 (∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥) ↔ ∃𝑥(𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥))
6 exanali 1861 . . 3 (∃𝑥(𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥) ↔ ¬ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥))
75, 6bitri 275 . 2 (∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥) ↔ ¬ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥))
82, 7bitr4di 289 1 ((𝐴𝑉𝐵𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1540  wex 1781  wcel 2114  wne 2932  cin 3888  c0 4273   class class class wbr 5085  [cec 8641
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148  df-xp 5637  df-cnv 5639  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-ec 8645
This theorem is referenced by:  disjecxrn  38733  brcoss3  38844  brcosscnv2  38884
  Copyright terms: Public domain W3C validator