| 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 2766 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 2 | vex 2766 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 3 | 1, 2 | opnzi 4269 | . . . . 5 ⊢ 〈𝑥, 𝑦〉 ≠ ∅ |
| 4 | simpl 109 | . . . . . . 7 ⊢ ((∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ∅ = 〈𝑥, 𝑦〉) | |
| 5 | 4 | eqcomd 2202 | . . . . . 6 ⊢ ((∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 〈𝑥, 𝑦〉 = ∅) |
| 6 | 5 | necon3ai 2416 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ≠ ∅ → ¬ (∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) |
| 7 | 3, 6 | ax-mp 5 | . . . 4 ⊢ ¬ (∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
| 8 | 7 | nex 1514 | . . 3 ⊢ ¬ ∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
| 9 | 8 | nex 1514 | . 2 ⊢ ¬ ∃𝑥∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) |
| 10 | elxp 4681 | . 2 ⊢ (∅ ∈ (𝐴 × 𝐵) ↔ ∃𝑥∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) | |
| 11 | 9, 10 | mtbir 672 | 1 ⊢ ¬ ∅ ∈ (𝐴 × 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ∧ wa 104 = wceq 1364 ∃wex 1506 ∈ wcel 2167 ≠ wne 2367 ∅c0 3451 〈cop 3626 × cxp 4662 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-v 2765 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-opab 4096 df-xp 4670 |
| This theorem is referenced by: 0nelrel 4710 dmsn0 5138 nfunv 5292 reldmtpos 6320 dmtpos 6323 0ncn 7915 structcnvcnv 12719 |
| Copyright terms: Public domain | W3C validator |