![]() |
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 5823 (this is a very limited reordering). |
Ref | Expression |
---|---|
bj-0nelopab | ⊢ ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relopab 5823 | . 2 ⊢ Rel {⟨𝑥, 𝑦⟩ ∣ 𝜑} | |
2 | 0nelrel0 5735 | . 2 ⊢ (Rel {⟨𝑥, 𝑦⟩ ∣ 𝜑} → ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∈ wcel 2107 ∅c0 4322 {copab 5210 Rel wrel 5681 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-ne 2942 df-rab 3434 df-v 3477 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-opab 5211 df-xp 5682 df-rel 5683 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |