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

Theorem equs5av 2271
Description: A property related to substitution that replaces the distinctor from equs5 2460 to a disjoint variable condition. Version of equs5a 2457 with a disjoint variable condition, which does not require ax-13 2372. See also sbalex 2235. (Contributed by NM, 2-Feb-2007.) (Revised by Gino Giotto, 15-Dec-2023.)
Assertion
Ref Expression
equs5av (∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦𝜑))
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem equs5av
StepHypRef Expression
1 nfa1 2148 . 2 𝑥𝑥(𝑥 = 𝑦𝜑)
2 ax12v2 2173 . . . 4 (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦𝜑)))
32spsd 2180 . . 3 (𝑥 = 𝑦 → (∀𝑦𝜑 → ∀𝑥(𝑥 = 𝑦𝜑)))
43imp 407 . 2 ((𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦𝜑))
51, 4exlimi 2210 1 (∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wal 1537  wex 1782
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-10 2137  ax-12 2171
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-ex 1783  df-nf 1787
This theorem is referenced by:  bj-equs45fv  34993
  Copyright terms: Public domain W3C validator