![]() |
Mathbox for BJ |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-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.) (Proof shortened
by BJ, 22-Jul-2023.)
TODO: move to the main section when one can reorder sections so that we can use relopab 5848 (this is a very limited reordering). |
Ref | Expression |
---|---|
bj-0nelopab | ⊢ ¬ ∅ ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relopab 5848 | . 2 ⊢ Rel {〈𝑥, 𝑦〉 ∣ 𝜑} | |
2 | 0nelrel0 5760 | . 2 ⊢ (Rel {〈𝑥, 𝑦〉 ∣ 𝜑} → ¬ ∅ ∈ {〈𝑥, 𝑦〉 ∣ 𝜑}) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ ¬ ∅ ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∈ wcel 2108 ∅c0 4352 {copab 5228 Rel wrel 5705 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-opab 5229 df-xp 5706 df-rel 5707 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |