| 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 4303 | . 2 ⊢ ((𝐴 ∩ 𝐵) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴 ∩ 𝐵)) | |
| 2 | elin 3918 | . . 3 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) | |
| 3 | 2 | exbii 1867 | . 2 ⊢ (∃𝑥 𝑥 ∈ (𝐴 ∩ 𝐵) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) |
| 4 | 1, 3 | bitri 277 | 1 ⊢ ((𝐴 ∩ 𝐵) ≠ ∅ ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∧ wa 399 ∃wex 1798 ∈ wcel 2141 ≠ wne 2956 ∩ cin 3901 ∅c0 4283 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-v 3455 df-dif 3905 df-in 3909 df-nul 4284 |
| This theorem is referenced by: xpcogend 14981 metsscmetcld 25365 0pssin 44308 |
| Copyright terms: Public domain | W3C validator |