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

Theorem axsepgfromrep 5246
Description: A more general version axsepg 5249 of the axiom scheme of separation ax-sep 5248 derived from the axiom scheme of replacement ax-rep 5231 (and first-order logic). The extra generality consists in the absence of a disjoint variable condition on 𝑧, 𝜑 (that is, variable 𝑧 may occur in formula 𝜑). See linked statements for more information. (Contributed by NM, 11-Sep-2006.) Remove dependencies on ax-9 2155 to ax-13 2401. (Revised by SN, 25-Sep-2023.) Use ax-sep 5248 instead (or axsepg 5249 if the extra generality is needed). (New usage is discouraged.)
Assertion
Ref Expression
axsepgfromrep ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
Distinct variable groups:   𝑥,𝑦,𝑧   𝜑,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑧)

Proof of Theorem axsepgfromrep
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 axrep6 5239 . . 3 (∀𝑤∃*𝑥(𝑤 = 𝑥 ∧ 𝜑) → ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑧 (𝑤 = 𝑥 ∧ 𝜑)))
2 euequ 2622 . . . . 5 ∃!𝑥 𝑥 = 𝑤
32eumoi 2604 . . . 4 ∃*𝑥 𝑥 = 𝑤
4 equcomi 2050 . . . . . 6 (𝑤 = 𝑥 → 𝑥 = 𝑤)
54adantr 486 . . . . 5 ((𝑤 = 𝑥 ∧ 𝜑) → 𝑥 = 𝑤)
65moimi 2570 . . . 4 (∃*𝑥 𝑥 = 𝑤 → ∃*𝑥(𝑤 = 𝑥 ∧ 𝜑))
73, 6ax-mp 5 . . 3 ∃*𝑥(𝑤 = 𝑥 ∧ 𝜑)
81, 7mpg 1830 . 2 ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑧 (𝑤 = 𝑥 ∧ 𝜑))
9 df-rex 3087 . . . . . 6 (∃𝑤 ∈ 𝑧 (𝑤 = 𝑥 ∧ 𝜑) ↔ ∃𝑤(𝑤 ∈ 𝑧 ∧ (𝑤 = 𝑥 ∧ 𝜑)))
10 an12 658 . . . . . . 7 ((𝑤 = 𝑥 ∧ (𝑤 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑤 ∈ 𝑧 ∧ (𝑤 = 𝑥 ∧ 𝜑)))
1110exbii 1881 . . . . . 6 (∃𝑤(𝑤 = 𝑥 ∧ (𝑤 ∈ 𝑧 ∧ 𝜑)) ↔ ∃𝑤(𝑤 ∈ 𝑧 ∧ (𝑤 = 𝑥 ∧ 𝜑)))
12 elequ1 2152 . . . . . . . 8 (𝑤 = 𝑥 → (𝑤 ∈ 𝑧 ↔ 𝑥 ∈ 𝑧))
1312anbi1d 643 . . . . . . 7 (𝑤 = 𝑥 → ((𝑤 ∈ 𝑧 ∧ 𝜑) ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))
1413equsexvw 2038 . . . . . 6 (∃𝑤(𝑤 = 𝑥 ∧ (𝑤 ∈ 𝑧 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
159, 11, 143bitr2i 302 . . . . 5 (∃𝑤 ∈ 𝑧 (𝑤 = 𝑥 ∧ 𝜑) ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
1615bibi2i 340 . . . 4 ((𝑥 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑧 (𝑤 = 𝑥 ∧ 𝜑)) ↔ (𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))
1716albii 1852 . . 3 (∀𝑥(𝑥 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑧 (𝑤 = 𝑥 ∧ 𝜑)) ↔ ∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))
1817exbii 1881 . 2 (∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ ∃𝑤 ∈ 𝑧 (𝑤 = 𝑥 ∧ 𝜑)) ↔ ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑)))
198, 18mpbi 233 1 ∃𝑦∀𝑥(𝑥 ∈ 𝑦 ↔ (𝑥 ∈ 𝑧 ∧ 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812  ∃*wmo 2562  ∃wrex 3086
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 2147  ax-rep 5231
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-mo 2564  df-eu 2594  df-rex 3087
This theorem is used by:  axsep  5247
  Copyright terms: Public domain W3C validator