| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opnz | Structured version Visualization version GIF version | ||
| Description: An ordered pair is nonempty iff the arguments are sets. (Contributed by NM, 24-Jan-2004.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| opnz | ⊢ (〈𝐴, 𝐵〉 ≠ ∅ ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opprc 4854 | . . 3 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 = ∅) | |
| 2 | 1 | necon1ai 2960 | . 2 ⊢ (〈𝐴, 𝐵〉 ≠ ∅ → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 3 | dfopg 4829 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) | |
| 4 | snex 5385 | . . . . 5 ⊢ {𝐴} ∈ V | |
| 5 | 4 | prnz 4736 | . . . 4 ⊢ {{𝐴}, {𝐴, 𝐵}} ≠ ∅ |
| 6 | 5 | a1i 11 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {{𝐴}, {𝐴, 𝐵}} ≠ ∅) |
| 7 | 3, 6 | eqnetrd 3000 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 ≠ ∅) |
| 8 | 2, 7 | impbii 209 | 1 ⊢ (〈𝐴, 𝐵〉 ≠ ∅ ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∈ wcel 2114 ≠ wne 2933 Vcvv 3442 ∅c0 4287 {csn 4582 {cpr 4584 〈cop 4588 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-v 3444 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 |
| This theorem is referenced by: opnzi 5430 opeqex 5454 opelopabsb 5486 setsfun0 17111 fmlaomn0 35603 |
| Copyright terms: Public domain | W3C validator |