Theorem rabnc 4357

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 4282	. 2 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∩ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) = {𝑥 ∈ 𝐴 ∣ (𝜑 ∧ ¬ 𝜑)}
2		pm3.24 402	. . . 4 ⊢ ¬ (𝜑 ∧ ¬ 𝜑)
3	2	rgenw 3049	. . 3 ⊢ ∀𝑥 ∈ 𝐴 ¬ (𝜑 ∧ ¬ 𝜑)
4		rabeq0 4354	. . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ (𝜑 ∧ ¬ 𝜑)} = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ (𝜑 ∧ ¬ 𝜑))
5	3, 4	mpbir 231	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ (𝜑 ∧ ¬ 𝜑)} = ∅
6	1, 5	eqtri 2753	1 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝜑} ∩ {𝑥 ∈ 𝐴 ∣ ¬ 𝜑}) = ∅

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1540  ∀wral 3045  {crab 3408   ∩ cin 3916  ∅c0 4299

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 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rab 3409  df-v 3452  df-dif 3920  df-in 3924  df-nul 4300

This theorem is referenced by:  elneldisj  4358  vtxdgoddnumeven  29488  esumrnmpt2  34065  hasheuni  34082  ddemeas  34233  ballotth  34536  jm2.22  42991