Theorem rabxm 4326

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 3333	. . 3 ⊢ (𝐴 = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)} ↔ ∀𝑥 ∈ 𝐴 (𝜑 ∨ ¬ 𝜑))
2		exmidd 894	. . 3 ⊢ (𝑥 ∈ 𝐴 → (𝜑 ∨ ¬ 𝜑))
3	1, 2	mprgbir 3069	. 2 ⊢ 𝐴 = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)}
4		unrab 4245	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)}
5	3, 4	eqtr4i 2767	1 ⊢ 𝐴 = ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑})

Syntax hints:  ¬ wn 3   ∨ wo 845   = wceq 1539   ∈ wcel 2104  {crab 3303   ∪ cun 3890

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-tru 1542  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-ral 3063  df-rab 3306  df-v 3439  df-un 3897

This theorem is referenced by:  elnelun  4329  vtxdgoddnumeven  27969  esumrnmpt2  32085  ddemeas  32253  ballotth  32553  mbfposadd  35872  jm2.22  41013