| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0nelopab | Structured version Visualization version GIF version | ||
| Description: The empty set is never an element in an ordered-pair class abstraction. (Contributed by Alexander van der Vekens, 5-Nov-2017.) Reduce axiom usage and shorten proof. (Revised by GG, 3-Oct-2024.) |
| Ref | Expression |
|---|---|
| 0nelopab | ⊢ ¬ ∅ ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 3484 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 2 | vex 3484 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 3 | 1, 2 | opnzi 5479 | . . . . . 6 ⊢ 〈𝑥, 𝑦〉 ≠ ∅ |
| 4 | 3 | nesymi 2998 | . . . . 5 ⊢ ¬ ∅ = 〈𝑥, 𝑦〉 |
| 5 | 4 | intnanr 487 | . . . 4 ⊢ ¬ (∅ = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 6 | 5 | nex 1800 | . . 3 ⊢ ¬ ∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 7 | 6 | nex 1800 | . 2 ⊢ ¬ ∃𝑥∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ 𝜑) |
| 8 | elopab 5532 | . 2 ⊢ (∅ ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(∅ = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 9 | 7, 8 | mtbir 323 | 1 ⊢ ¬ ∅ ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∧ wa 395 = wceq 1540 ∃wex 1779 ∈ wcel 2108 ∅c0 4333 〈cop 4632 {copab 5205 |
| 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 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pr 5432 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ne 2941 df-v 3482 df-dif 3954 df-un 3956 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-opab 5206 |
| This theorem is referenced by: brabv 5573 epelg 5585 satf0n0 35383 bj-0nelmpt 37117 |
| Copyright terms: Public domain | W3C validator |