Theorem rabxm 4385

Description: Law of excluded middle, in terms of restricted class abstractions. (Contributed by Jeff Madsen, 20-Jun-2011.)

Assertion

Ref	Expression
rabxm	⊢ 𝐴 = ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑})

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rabxm

Step	Hyp	Ref	Expression
1		rabid2 3464	. . 3 ⊢ (𝐴 = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)} ↔ ∀𝑥 ∈ 𝐴 (𝜑 ∨ ¬ 𝜑))
2		exmidd 894	. . 3 ⊢ (𝑥 ∈ 𝐴 → (𝜑 ∨ ¬ 𝜑))
3	1, 2	mprgbir 3068	. 2 ⊢ 𝐴 = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)}
4		unrab 4304	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)}
5	3, 4	eqtr4i 2763	1 ⊢ 𝐴 = ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑})

Syntax hints:  ¬ wn 3   ∨ wo 845   = wceq 1541   ∈ wcel 2106  {crab 3432   ∪ cun 3945

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-8 2108  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-ex 1782  df-nf 1786  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ral 3062  df-rab 3433  df-v 3476  df-un 3952

This theorem is referenced by:  elnelun  4388  vtxdgoddnumeven  28799  esumrnmpt2  33054  ddemeas  33222  ballotth  33524  mbfposadd  36523  jm2.22  41719