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

Theorem equs45f 2491
Description: Two ways of expressing substitution when 𝑦 is not free in 𝜑. The implication "to the left" is equs4 2448 and does not require the nonfreeness hypothesis. Theorem sbalex 2281 replaces the nonfreeness hypothesis with a disjoint variable condition and equs5 2492 replaces it with a distinctor antecedent. (Contributed by NM, 25-Apr-2008.) (Revised by Mario Carneiro, 4-Oct-2016.) Usage of this theorem is discouraged because it depends on ax-13 2404. Use sbalex 2281 instead. (New usage is discouraged.)
Hypothesis
Ref Expression
equs45f.1 Ⅎ𝑦𝜑
Assertion
Ref Expression
equs45f (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))

Proof of Theorem equs45f
StepHypRef Expression
1 equs45f.1 . . . . . 6 Ⅎ𝑦𝜑
21nf5ri 2234 . . . . 5 (𝜑 → ∀𝑦𝜑)
32anim2i 629 . . . 4 ((𝑥 = 𝑦 ∧ 𝜑) → (𝑥 = 𝑦 ∧ ∀𝑦𝜑))
43eximi 1867 . . 3 (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑))
5 equs5a 2489 . . 3 (∃𝑥(𝑥 = 𝑦 ∧ ∀𝑦𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑))
64, 5syl 18 . 2 (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑦 → 𝜑))
7 equs4 2448 . 2 (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))
86, 7impbii 212 1 (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) ↔ ∀𝑥(𝑥 = 𝑦 → 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567  ∃wex 1811  Ⅎwnf 1815
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 1944  ax-6 2001  ax-7 2042  ax-10 2179  ax-12 2215  ax-13 2404
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1812  df-nf 1816
This theorem is used by:  sb5f  2530
  Copyright terms: Public domain W3C validator