![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > 0nelxp | GIF version |
Description: The empty set is not a member of a cross product. (Contributed by NM, 2-May-1996.) (Revised by Mario Carneiro, 26-Apr-2015.) |
Ref | Expression |
---|---|
0nelxp | ⊢ ¬ ∅ ∈ (𝐴 × 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 2740 | . . . . . 6 ⊢ 𝑥 ∈ V | |
2 | vex 2740 | . . . . . 6 ⊢ 𝑦 ∈ V | |
3 | 1, 2 | opnzi 4231 | . . . . 5 ⊢ 〈𝑥, 𝑦〉 ≠ ∅ |
4 | simpl 109 | . . . . . . 7 ⊢ ((∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ∅ = 〈𝑥, 𝑦〉) | |
5 | 4 | eqcomd 2183 | . . . . . 6 ⊢ ((∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 〈𝑥, 𝑦〉 = ∅) |
6 | 5 | necon3ai 2396 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ≠ ∅ → ¬ (∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) |
7 | 3, 6 | ax-mp 5 | . . . 4 ⊢ ¬ (∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
8 | 7 | nex 1500 | . . 3 ⊢ ¬ ∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
9 | 8 | nex 1500 | . 2 ⊢ ¬ ∃𝑥∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
10 | elxp 4639 | . 2 ⊢ (∅ ∈ (𝐴 × 𝐵) ↔ ∃𝑥∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) | |
11 | 9, 10 | mtbir 671 | 1 ⊢ ¬ ∅ ∈ (𝐴 × 𝐵) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 ∧ wa 104 = wceq 1353 ∃wex 1492 ∈ wcel 2148 ≠ wne 2347 ∅c0 3422 〈cop 3594 × cxp 4620 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4118 ax-pow 4171 ax-pr 4205 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-v 2739 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-opab 4062 df-xp 4628 |
This theorem is referenced by: 0nelrel 4668 dmsn0 5091 nfunv 5244 reldmtpos 6247 dmtpos 6250 0ncn 7808 structcnvcnv 12448 |
Copyright terms: Public domain | W3C validator |