![]() |
Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > ecinn0 | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
ecinn0 | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ecin0 37221 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) = ∅ ↔ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥))) | |
2 | 1 | necon3abid 2978 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ¬ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥))) |
3 | notnotb 315 | . . . . 5 ⊢ (𝐵𝑅𝑥 ↔ ¬ ¬ 𝐵𝑅𝑥) | |
4 | 3 | anbi2i 624 | . . . 4 ⊢ ((𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) ↔ (𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥)) |
5 | 4 | exbii 1851 | . . 3 ⊢ (∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) ↔ ∃𝑥(𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥)) |
6 | exanali 1863 | . . 3 ⊢ (∃𝑥(𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥) ↔ ¬ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥)) | |
7 | 5, 6 | bitri 275 | . 2 ⊢ (∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) ↔ ¬ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥)) |
8 | 2, 7 | bitr4di 289 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∀wal 1540 ∃wex 1782 ∈ wcel 2107 ≠ wne 2941 ∩ cin 3948 ∅c0 4323 class class class wbr 5149 [cec 8701 |
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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pr 5428 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-ne 2942 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-br 5150 df-opab 5212 df-xp 5683 df-cnv 5685 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-ec 8705 |
This theorem is referenced by: disjecxrn 37259 brcoss3 37303 brcosscnv2 37343 |
Copyright terms: Public domain | W3C validator |