Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1476 Structured version   Visualization version   GIF version

Theorem bnj1476 35267
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1476.1 𝐷 = {𝑥𝐴 ∣ ¬ 𝜑}
bnj1476.2 (𝜓𝐷 = ∅)
Assertion
Ref Expression
bnj1476 (𝜓 → ∀𝑥𝐴 𝜑)

Proof of Theorem bnj1476
StepHypRef Expression
1 bnj1476.2 . . . 4 (𝜓𝐷 = ∅)
2 bnj1476.1 . . . . . 6 𝐷 = {𝑥𝐴 ∣ ¬ 𝜑}
3 nfrab1 3439 . . . . . 6 𝑥{𝑥𝐴 ∣ ¬ 𝜑}
42, 3nfcxfr 2926 . . . . 5 𝑥𝐷
54eq0f 4304 . . . 4 (𝐷 = ∅ ↔ ∀𝑥 ¬ 𝑥𝐷)
61, 5sylib 221 . . 3 (𝜓 → ∀𝑥 ¬ 𝑥𝐷)
72reqabi 3442 . . . . 5 (𝑥𝐷 ↔ (𝑥𝐴 ∧ ¬ 𝜑))
87notbii 323 . . . 4 𝑥𝐷 ↔ ¬ (𝑥𝐴 ∧ ¬ 𝜑))
9 iman 407 . . . 4 ((𝑥𝐴𝜑) ↔ ¬ (𝑥𝐴 ∧ ¬ 𝜑))
108, 9sylbb2 241 . . 3 𝑥𝐷 → (𝑥𝐴𝜑))
116, 10sylg 1856 . 2 (𝜓 → ∀𝑥(𝑥𝐴𝜑))
1211ralrid 3090 1 (𝜓 → ∀𝑥𝐴 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401  wal 1568   = wceq 1570  wcel 2146  wral 3082  {crab 3419  c0 4289
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ral 3083  df-rab 3420  df-dif 3911  df-nul 4290
This theorem is used by:  bnj1312  35478
  Copyright terms: Public domain W3C validator