| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rabxm | Structured version Visualization version GIF version | ||
| Description: Law of excluded middle, in terms of restricted class abstractions. (Contributed by Jeff Madsen, 20-Jun-2011.) |
| Ref | Expression |
|---|---|
| rabxm | ⊢ 𝐴 = ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rabid2im 3447 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ ¬ 𝜑) → 𝐴 = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)}) | |
| 2 | exmidd 906 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝜑 ∨ ¬ 𝜑)) | |
| 3 | 1, 2 | mprg 3083 | . 2 ⊢ 𝐴 = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)} |
| 4 | unrab 4268 | . 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)} | |
| 5 | 3, 4 | eqtr4i 2789 | 1 ⊢ 𝐴 = ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∨ wo 858 = wceq 1561 ∈ wcel 2143 {crab 3415 ∪ cun 3903 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-12 2213 ax-ext 2735 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1564 df-ex 1801 df-nf 1805 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3078 df-rab 3416 df-v 3457 df-un 3910 |
| This theorem is referenced by: elnelun 4348 vtxdgoddnumeven 29761 esumrnmpt2 34367 ddemeas 34535 ballotth 34837 mbfposadd 38171 jm2.22 43577 |
| Copyright terms: Public domain | W3C validator |