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

Theorem equs5 2455
Description: Lemma used in proofs of substitution properties. If there is a disjoint variable condition on 𝑥, 𝑦, then sbalex 2231 can be used instead; if 𝑦 is not free in 𝜑, then equs45f 2454 can be used. Usage of this theorem is discouraged because it depends on ax-13 2367. (Contributed by NM, 14-May-1993.) (Revised by BJ, 1-Oct-2018.) (New usage is discouraged.)
Assertion
Ref Expression
equs5 (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦𝜑) ↔ ∀𝑥(𝑥 = 𝑦𝜑)))

Proof of Theorem equs5
StepHypRef Expression
1 nfna1 2142 . . 3 𝑥 ¬ ∀𝑥 𝑥 = 𝑦
2 nfa1 2141 . . 3 𝑥𝑥(𝑥 = 𝑦𝜑)
3 axc15 2417 . . . 4 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦𝜑))))
43impd 410 . . 3 (¬ ∀𝑥 𝑥 = 𝑦 → ((𝑥 = 𝑦𝜑) → ∀𝑥(𝑥 = 𝑦𝜑)))
51, 2, 4exlimd 2207 . 2 (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦𝜑) → ∀𝑥(𝑥 = 𝑦𝜑)))
6 equs4 2411 . 2 (∀𝑥(𝑥 = 𝑦𝜑) → ∃𝑥(𝑥 = 𝑦𝜑))
75, 6impbid1 224 1 (¬ ∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑦𝜑) ↔ ∀𝑥(𝑥 = 𝑦𝜑)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395  wal 1532  wex 1774
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-10 2130  ax-12 2167  ax-13 2367
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-ex 1775  df-nf 1779
This theorem is referenced by:  sb3b  2471  bj-sbsb  36314
  Copyright terms: Public domain W3C validator