Theorem rabnc 4338

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

Assertion

Ref	Expression
rabnc	⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∩ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) = ∅

Proof of Theorem rabnc

Step	Hyp	Ref	Expression
1		inrab 4263	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∩ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) = {𝑥 ∈ 𝐴 ∣ (𝜑 ∧ ¬ 𝜑)}
2		pm3.24 402	. . . 4 ⊢ ¬ (𝜑 ∧ ¬ 𝜑)
3	2	rgenw 3051	. . 3 ⊢ ∀𝑥 ∈ 𝐴 ¬ (𝜑 ∧ ¬ 𝜑)
4		rabeq0 4335	. . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ (𝜑 ∧ ¬ 𝜑)} = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ (𝜑 ∧ ¬ 𝜑))
5	3, 4	mpbir 231	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝜑 ∧ ¬ 𝜑)} = ∅
6	1, 5	eqtri 2754	1 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∩ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) = ∅

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1541  ∀wral 3047  {crab 3395   ∩ cin 3896  ∅c0 4280

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rab 3396  df-v 3438  df-dif 3900  df-in 3904  df-nul 4281

This theorem is referenced by:  elneldisj  4339  vtxdgoddnumeven  29532  esumrnmpt2  34081  hasheuni  34098  ddemeas  34249  ballotth  34551  jm2.22  43098