Theorem rabxm 4346

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		rabid2im 3447	. . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ ¬ 𝜑) → 𝐴 = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)})
2		exmidd 908	. . 3 ⊢ (𝑥 ∈ 𝐴 → (𝜑 ∨ ¬ 𝜑))
3	1, 2	mprg 3084	. 2 ⊢ 𝐴 = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)}
4		unrab 4267	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) = {𝑥 ∈ 𝐴 ∣ (𝜑 ∨ ¬ 𝜑)}
5	3, 4	eqtr4i 2788	1 ⊢ 𝐴 = ({𝑥 ∈ 𝐴 ∣ 𝜑} ∪ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑})

This proof depends on syntax axioms:  ¬ wn 3   ∨ wo 860   = wceq 1569   ∈ wcel 2142  {crab 3415   ∪ cun 3902

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-12 2212  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1572  df-ex 1809  df-nf 1813  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rab 3416  df-v 3456  df-un 3909

This theorem is used by:  elnelun  4349  vtxdgoddnumeven  29914  esumrnmpt2  34467  ddemeas  34635  ballotth  34937  mbfposadd  38346  jm2.22  43750