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

Theorem notzfaus 5359
Description: In the Separation Scheme zfauscl 5298, we require that 𝑦 not occur in 𝜑 (which can be generalized to "not be free in"). Here we show special cases of 𝐴 and 𝜑 that result in a contradiction if that requirement is not met. (Contributed by NM, 8-Feb-2006.) (Proof shortened by BJ, 18-Nov-2023.)
Hypotheses
Ref Expression
notzfaus.1 𝐴 = {∅}
notzfaus.2 (𝜑 ↔ ¬ 𝑥𝑦)
Assertion
Ref Expression
notzfaus ¬ ∃𝑦𝑥(𝑥𝑦 ↔ (𝑥𝐴𝜑))
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑦)

Proof of Theorem notzfaus
StepHypRef Expression
1 notzfaus.1 . . . . . 6 𝐴 = {∅}
2 0ex 5304 . . . . . . 7 ∅ ∈ V
32snnz 4775 . . . . . 6 {∅} ≠ ∅
41, 3eqnetri 3001 . . . . 5 𝐴 ≠ ∅
5 n0 4346 . . . . 5 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
64, 5mpbi 229 . . . 4 𝑥 𝑥𝐴
7 pm5.19 385 . . . . 5 ¬ (𝑥𝑦 ↔ ¬ 𝑥𝑦)
8 ibar 527 . . . . . . 7 (𝑥𝐴 → (𝜑 ↔ (𝑥𝐴𝜑)))
9 notzfaus.2 . . . . . . 7 (𝜑 ↔ ¬ 𝑥𝑦)
108, 9bitr3di 285 . . . . . 6 (𝑥𝐴 → ((𝑥𝐴𝜑) ↔ ¬ 𝑥𝑦))
1110bibi2d 341 . . . . 5 (𝑥𝐴 → ((𝑥𝑦 ↔ (𝑥𝐴𝜑)) ↔ (𝑥𝑦 ↔ ¬ 𝑥𝑦)))
127, 11mtbiri 326 . . . 4 (𝑥𝐴 → ¬ (𝑥𝑦 ↔ (𝑥𝐴𝜑)))
136, 12eximii 1832 . . 3 𝑥 ¬ (𝑥𝑦 ↔ (𝑥𝐴𝜑))
14 exnal 1822 . . 3 (∃𝑥 ¬ (𝑥𝑦 ↔ (𝑥𝐴𝜑)) ↔ ¬ ∀𝑥(𝑥𝑦 ↔ (𝑥𝐴𝜑)))
1513, 14mpbi 229 . 2 ¬ ∀𝑥(𝑥𝑦 ↔ (𝑥𝐴𝜑))
1615nex 1795 1 ¬ ∃𝑦𝑥(𝑥𝑦 ↔ (𝑥𝐴𝜑))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 205  wa 394  wal 1532   = wceq 1534  wex 1774  wcel 2099  wne 2930  c0 4322  {csn 4623
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2697  ax-nul 5303
This theorem depends on definitions:  df-bi 206  df-an 395  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2704  df-cleq 2718  df-clel 2803  df-ne 2931  df-v 3464  df-dif 3949  df-nul 4323  df-sn 4624
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator