| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ndisj | Structured version Visualization version GIF version | ||
| Description: Express that an intersection is not empty. (Contributed by RP, 16-Apr-2020.) |
| Ref | Expression |
|---|---|
| ndisj | ⊢ ((𝐴 ∩ 𝐵) ≠ ∅ ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4314 | . 2 ⊢ ((𝐴 ∩ 𝐵) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴 ∩ 𝐵)) | |
| 2 | elin 3929 | . . 3 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) | |
| 3 | 2 | exbii 1875 | . 2 ⊢ (∃𝑥 𝑥 ∈ (𝐴 ∩ 𝐵) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) |
| 4 | 1, 3 | bitri 278 | 1 ⊢ ((𝐴 ∩ 𝐵) ≠ ∅ ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 ∃wex 1806 ∈ wcel 2149 ≠ wne 2964 ∩ cin 3912 ∅c0 4294 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-v 3465 df-dif 3916 df-in 3920 df-nul 4295 |
| This theorem is referenced by: xpcogend 15007 metsscmetcld 25439 0pssin 44382 |
| Copyright terms: Public domain | W3C validator |