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

Theorem mof 2591
Description: Version of df-mo 2567 with disjoint variable condition replaced by nonfreeness hypothesis. (Contributed by NM, 8-Mar-1995.) Extract dfmo 2568 from this proof, and prove mof 2591 from it (as of 30-Sep-2022, directly from df-mo 2567). (Revised by Wolf Lammen, 28-May-2019.) Avoid ax-13 2404. (Revised by Wolf Lammen, 16-Oct-2022.)
Hypothesis
Ref Expression
mof.1 Ⅎ𝑦𝜑
Assertion
Ref Expression
mof (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem mof
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 dfmo 2568 . 2 (∃*𝑥𝜑 ↔ ∃𝑧∀𝑥(𝜑 → 𝑥 = 𝑧))
2 mof.1 . . . . 5 Ⅎ𝑦𝜑
3 nfv 1949 . . . . 5 Ⅎ𝑦 𝑥 = 𝑧
42, 3nfim 1931 . . . 4 Ⅎ𝑦(𝜑 → 𝑥 = 𝑧)
54nfal 2357 . . 3 Ⅎ𝑦∀𝑥(𝜑 → 𝑥 = 𝑧)
6 nfv 1949 . . 3 Ⅎ𝑧∀𝑥(𝜑 → 𝑥 = 𝑦)
7 equequ2 2061 . . . . 5 (𝑧 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑥 = 𝑦))
87imbi2d 343 . . . 4 (𝑧 = 𝑦 → ((𝜑 → 𝑥 = 𝑧) ↔ (𝜑 → 𝑥 = 𝑦)))
98albidv 1955 . . 3 (𝑧 = 𝑦 → (∀𝑥(𝜑 → 𝑥 = 𝑧) ↔ ∀𝑥(𝜑 → 𝑥 = 𝑦)))
105, 6, 9cbvexv1 2375 . 2 (∃𝑧∀𝑥(𝜑 → 𝑥 = 𝑧) ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
111, 10bitri 278 1 (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568  ∃wex 1812  Ⅎwnf 1816  ∃*wmo 2565
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 1945  ax-6 2002  ax-7 2043  ax-10 2180  ax-11 2197  ax-12 2216
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-mo 2567
This theorem is used by:  mo3  2592  mo  2593  rmo2  3838  dffun3f  10005  nmo  33161  fineqvrep  35895  bj-eu3f  37944  permaxrep  46202
  Copyright terms: Public domain W3C validator