| 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 38457 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) = ∅ ↔ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥))) | |
| 2 | 1 | necon3abid 2965 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ¬ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥))) |
| 3 | notnotb 315 | . . . . 5 ⊢ (𝐵𝑅𝑥 ↔ ¬ ¬ 𝐵𝑅𝑥) | |
| 4 | 3 | anbi2i 623 | . . . 4 ⊢ ((𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) ↔ (𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥)) |
| 5 | 4 | exbii 1849 | . . 3 ⊢ (∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) ↔ ∃𝑥(𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥)) |
| 6 | exanali 1860 | . . 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 206 ∧ wa 395 ∀wal 1539 ∃wex 1780 ∈ wcel 2113 ≠ wne 2929 ∩ cin 3897 ∅c0 4282 class class class wbr 5095 [cec 8629 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pr 5374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2712 df-cleq 2725 df-clel 2808 df-ne 2930 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-sn 4578 df-pr 4580 df-op 4584 df-br 5096 df-opab 5158 df-xp 5627 df-cnv 5629 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-ec 8633 |
| This theorem is referenced by: disjecxrn 38509 brcoss3 38608 brcosscnv2 38648 |
| Copyright terms: Public domain | W3C validator |