Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 0nelxp | Structured version Visualization version GIF version |
Description: The empty set is not a member of a Cartesian product. (Contributed by NM, 2-May-1996.) (Revised by Mario Carneiro, 26-Apr-2015.) (Proof shortened by JJ, 13-Aug-2021.) |
Ref | Expression |
---|---|
0nelxp | ⊢ ¬ ∅ ∈ (𝐴 × 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 3500 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
2 | vex 3500 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
3 | 1, 2 | opnzi 5369 | . . . . . 6 ⊢ 〈𝑥, 𝑦〉 ≠ ∅ |
4 | 3 | nesymi 3076 | . . . . 5 ⊢ ¬ ∅ = 〈𝑥, 𝑦〉 |
5 | 4 | intnanr 490 | . . . 4 ⊢ ¬ (∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
6 | 5 | nex 1800 | . . 3 ⊢ ¬ ∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
7 | 6 | nex 1800 | . 2 ⊢ ¬ ∃𝑥∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
8 | elxp 5581 | . 2 ⊢ (∅ ∈ (𝐴 × 𝐵) ↔ ∃𝑥∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) | |
9 | 7, 8 | mtbir 325 | 1 ⊢ ¬ ∅ ∈ (𝐴 × 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 398 = wceq 1536 ∃wex 1779 ∈ wcel 2113 ∅c0 4294 〈cop 4576 × cxp 5556 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-opab 5132 df-xp 5564 |
This theorem is referenced by: 0nelrel0 5615 nrelv 5676 dmsn0 6069 onxpdisj 6313 mpoxopx0ov0 7885 dmtpos 7907 0nnq 10349 adderpq 10381 mulerpq 10382 lterpq 10395 0ncn 10558 structcnvcnv 16500 vtxval0 26827 iedgval0 26828 msrrcl 32794 |
Copyright terms: Public domain | W3C validator |