MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rabnc Structured version   Visualization version   GIF version

Theorem rabnc 4295
Description: Law of noncontradiction, in terms of restricted class abstractions. (Contributed by Jeff Madsen, 20-Jun-2011.)
Assertion
Ref Expression
rabnc ({𝑥𝐴𝜑} ∩ {𝑥𝐴 ∣ ¬ 𝜑}) = ∅
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rabnc
StepHypRef Expression
1 inrab 4227 . 2 ({𝑥𝐴𝜑} ∩ {𝑥𝐴 ∣ ¬ 𝜑}) = {𝑥𝐴 ∣ (𝜑 ∧ ¬ 𝜑)}
2 pm3.24 406 . . . 4 ¬ (𝜑 ∧ ¬ 𝜑)
32rgenw 3118 . . 3 𝑥𝐴 ¬ (𝜑 ∧ ¬ 𝜑)
4 rabeq0 4292 . . 3 ({𝑥𝐴 ∣ (𝜑 ∧ ¬ 𝜑)} = ∅ ↔ ∀𝑥𝐴 ¬ (𝜑 ∧ ¬ 𝜑))
53, 4mpbir 234 . 2 {𝑥𝐴 ∣ (𝜑 ∧ ¬ 𝜑)} = ∅
61, 5eqtri 2821 1 ({𝑥𝐴𝜑} ∩ {𝑥𝐴 ∣ ¬ 𝜑}) = ∅
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 399   = wceq 1538  wral 3106  {crab 3110  cin 3880  c0 4243
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rab 3115  df-v 3443  df-dif 3884  df-in 3888  df-nul 4244
This theorem is referenced by:  elneldisj  4296  vtxdgoddnumeven  27343  esumrnmpt2  31437  hasheuni  31454  ddemeas  31605  ballotth  31905  jm2.22  39936
  Copyright terms: Public domain W3C validator