| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ab0orv | Structured version Visualization version GIF version | ||
| Description: The class abstraction defined by a formula not containing the abstraction variable is either the empty set or the universal class. (Contributed by Mario Carneiro, 29-Aug-2013.) (Revised by BJ, 22-Mar-2020.) Reduce axiom usage. (Revised by GG, 30-Aug-2024.) |
| Ref | Expression |
|---|---|
| ab0orv | ⊢ ({𝑥 ∣ 𝜑} = V ∨ {𝑥 ∣ 𝜑} = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1934 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
| 2 | nf3 1806 | . . 3 ⊢ (Ⅎ𝑦𝜑 ↔ (∀𝑦𝜑 ∨ ∀𝑦 ¬ 𝜑)) | |
| 3 | 1, 2 | mpbi 232 | . 2 ⊢ (∀𝑦𝜑 ∨ ∀𝑦 ¬ 𝜑) |
| 4 | biidd 264 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜑)) | |
| 5 | 4 | eqabcbw 2836 | . . . 4 ⊢ ({𝑥 ∣ 𝜑} = {𝑥 ∣ ⊤} ↔ ∀𝑦(𝜑 ↔ 𝑦 ∈ {𝑥 ∣ ⊤})) |
| 6 | dfv2 3457 | . . . . 5 ⊢ V = {𝑥 ∣ ⊤} | |
| 7 | 6 | eqeq2i 2775 | . . . 4 ⊢ ({𝑥 ∣ 𝜑} = V ↔ {𝑥 ∣ 𝜑} = {𝑥 ∣ ⊤}) |
| 8 | vextru 2747 | . . . . . 6 ⊢ 𝑦 ∈ {𝑥 ∣ ⊤} | |
| 9 | 8 | tbt 371 | . . . . 5 ⊢ (𝜑 ↔ (𝜑 ↔ 𝑦 ∈ {𝑥 ∣ ⊤})) |
| 10 | 9 | albii 1839 | . . . 4 ⊢ (∀𝑦𝜑 ↔ ∀𝑦(𝜑 ↔ 𝑦 ∈ {𝑥 ∣ ⊤})) |
| 11 | 5, 7, 10 | 3bitr4i 305 | . . 3 ⊢ ({𝑥 ∣ 𝜑} = V ↔ ∀𝑦𝜑) |
| 12 | 4 | ab0w 4332 | . . 3 ⊢ ({𝑥 ∣ 𝜑} = ∅ ↔ ∀𝑦 ¬ 𝜑) |
| 13 | 11, 12 | orbi12i 925 | . 2 ⊢ (({𝑥 ∣ 𝜑} = V ∨ {𝑥 ∣ 𝜑} = ∅) ↔ (∀𝑦𝜑 ∨ ∀𝑦 ¬ 𝜑)) |
| 14 | 3, 13 | mpbir 233 | 1 ⊢ ({𝑥 ∣ 𝜑} = V ∨ {𝑥 ∣ 𝜑} = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 208 ∨ wo 858 ∀wal 1558 = wceq 1560 ⊤wtru 1561 Ⅎwnf 1803 ∈ wcel 2142 {cab 2740 Vcvv 3454 ∅c0 4285 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-clab 2741 df-cleq 2754 df-v 3456 df-dif 3907 df-nul 4286 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |