![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ab0orvALT | Structured version Visualization version GIF version |
Description: Alternate proof of ab0orv 4377, shorter but using more axioms. (Contributed by Mario Carneiro, 29-Aug-2013.) (Revised by BJ, 22-Mar-2020.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
ab0orvALT | ⊢ ({𝑥 ∣ 𝜑} = V ∨ {𝑥 ∣ 𝜑} = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1917 | . 2 ⊢ Ⅎ𝑥𝜑 | |
2 | dfnf5 4376 | . 2 ⊢ (Ⅎ𝑥𝜑 ↔ ({𝑥 ∣ 𝜑} = V ∨ {𝑥 ∣ 𝜑} = ∅)) | |
3 | 1, 2 | mpbi 229 | 1 ⊢ ({𝑥 ∣ 𝜑} = V ∨ {𝑥 ∣ 𝜑} = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ∨ wo 845 = wceq 1541 Ⅎwnf 1785 {cab 2709 Vcvv 3474 ∅c0 4321 |
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 1913 ax-6 1971 ax-7 2011 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-clab 2710 df-cleq 2724 df-v 3476 df-dif 3950 df-nul 4322 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |