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

Theorem axsep2 4976
Description: A less restrictive version of the Separation Scheme axsep 4974, where variables 𝑥 and 𝑧 can both appear free in the wff 𝜑, which can therefore be thought of as 𝜑(𝑥, 𝑧). This version was derived from the more restrictive ax-sep 4975 with no additional set theory axioms. (Contributed by NM, 10-Dec-2006.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)
Assertion
Ref Expression
axsep2 𝑦𝑥(𝑥𝑦 ↔ (𝑥𝑧𝜑))
Distinct variable groups:   𝑥,𝑦,𝑧   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑧)

Proof of Theorem axsep2
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 elequ2 2171 . . . . . . 7 (𝑤 = 𝑧 → (𝑥𝑤𝑥𝑧))
21anbi1d 624 . . . . . 6 (𝑤 = 𝑧 → ((𝑥𝑤 ∧ (𝑥𝑧𝜑)) ↔ (𝑥𝑧 ∧ (𝑥𝑧𝜑))))
3 anabs5 654 . . . . . 6 ((𝑥𝑧 ∧ (𝑥𝑧𝜑)) ↔ (𝑥𝑧𝜑))
42, 3syl6bb 279 . . . . 5 (𝑤 = 𝑧 → ((𝑥𝑤 ∧ (𝑥𝑧𝜑)) ↔ (𝑥𝑧𝜑)))
54bibi2d 334 . . . 4 (𝑤 = 𝑧 → ((𝑥𝑦 ↔ (𝑥𝑤 ∧ (𝑥𝑧𝜑))) ↔ (𝑥𝑦 ↔ (𝑥𝑧𝜑))))
65albidv 2016 . . 3 (𝑤 = 𝑧 → (∀𝑥(𝑥𝑦 ↔ (𝑥𝑤 ∧ (𝑥𝑧𝜑))) ↔ ∀𝑥(𝑥𝑦 ↔ (𝑥𝑧𝜑))))
76exbidv 2017 . 2 (𝑤 = 𝑧 → (∃𝑦𝑥(𝑥𝑦 ↔ (𝑥𝑤 ∧ (𝑥𝑧𝜑))) ↔ ∃𝑦𝑥(𝑥𝑦 ↔ (𝑥𝑧𝜑))))
8 ax-sep 4975 . 2 𝑦𝑥(𝑥𝑦 ↔ (𝑥𝑤 ∧ (𝑥𝑧𝜑)))
97, 8chvarv 2403 1 𝑦𝑥(𝑥𝑦 ↔ (𝑥𝑧𝜑))
Colors of variables: wff setvar class
Syntax hints:  wb 198  wa 385  wal 1651  wex 1875
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-12 2213  ax-13 2377  ax-sep 4975
This theorem depends on definitions:  df-bi 199  df-an 386  df-ex 1876  df-nf 1880
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator