| 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 38789 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) = ∅ ↔ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥))) | |
| 2 | 1 | necon3abid 2983 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ¬ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥))) |
| 3 | notnotb 317 | . . . . 5 ⊢ (𝐵𝑅𝑥 ↔ ¬ ¬ 𝐵𝑅𝑥) | |
| 4 | 3 | anbi2i 631 | . . . 4 ⊢ ((𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) ↔ (𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥)) |
| 5 | 4 | exbii 1858 | . . 3 ⊢ (∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) ↔ ∃𝑥(𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥)) |
| 6 | exanali 1869 | . . 3 ⊢ (∃𝑥(𝐴𝑅𝑥 ∧ ¬ ¬ 𝐵𝑅𝑥) ↔ ¬ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥)) | |
| 7 | 5, 6 | bitri 277 | . 2 ⊢ (∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) ↔ ¬ ∀𝑥(𝐴𝑅𝑥 → ¬ 𝐵𝑅𝑥)) |
| 8 | 2, 7 | bitr4di 291 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (([𝐴]𝑅 ∩ [𝐵]𝑅) ≠ ∅ ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∀wal 1548 ∃wex 1789 ∈ wcel 2132 ≠ wne 2947 ∩ cin 3894 ∅c0 4276 class class class wbr 5090 [cec 8660 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-ext 2724 ax-sep 5236 ax-pr 5380 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-sb 2081 df-clab 2731 df-cleq 2744 df-clel 2827 df-ne 2948 df-ral 3067 df-rex 3077 df-rab 3405 df-v 3446 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-nul 4277 df-if 4471 df-sn 4573 df-pr 4575 df-op 4579 df-br 5091 df-opab 5153 df-xp 5642 df-cnv 5644 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-ec 8664 |
| This theorem is referenced by: disjecxrn 38849 brcoss3 38960 brcosscnv2 39000 |
| Copyright terms: Public domain | W3C validator |