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

Theorem axsep 5247
Description: Axiom scheme of separation ax-sep 5248 derived from the axiom scheme of replacement ax-rep 5231. The statement is identical to that of ax-sep 5248, and therefore shows that ax-sep 5248 is redundant when ax-rep 5231 is allowed. See ax-sep 5248 for more information. (Contributed by NM, 11-Sep-2006.) Use ax-sep 5248 instead. (New usage is discouraged.)
Assertion
Ref Expression
axsep ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
Distinct variable groups:   𝑥,𝑦,𝑧   𝜑,𝑦,𝑧
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem axsep
StepHypRef Expression
1 axsepgfromrep 5246 1 ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∀wal 1567  ∃wex 1811
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-rep 5231
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-mo 2564  df-eu 2594  df-rex 3087
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator