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

Theorem cbvexd 2431
Description: Deduction used to change bound variables, using implicit substitution, particularly useful in conjunction with dvelim 2475. Usage of this theorem is discouraged because it depends on ax-13 2392. Use the weaker cbvexdw 2361 if possible. (Contributed by NM, 2-Jan-2002.) (Revised by Mario Carneiro, 6-Oct-2016.) (New usage is discouraged.)
Hypotheses
Ref Expression
cbvald.1 𝑦𝜑
cbvald.2 (𝜑 → Ⅎ𝑦𝜓)
cbvald.3 (𝜑 → (𝑥 = 𝑦 → (𝜓𝜒)))
Assertion
Ref Expression
cbvexd (𝜑 → (∃𝑥𝜓 ↔ ∃𝑦𝜒))
Distinct variable groups:   𝜑,𝑥   𝜒,𝑥
Allowed substitution hints:   𝜑(𝑦)   𝜓(𝑥,𝑦)   𝜒(𝑦)

Proof of Theorem cbvexd
StepHypRef Expression
1 cbvald.1 . . . 4 𝑦𝜑
2 cbvald.2 . . . . 5 (𝜑 → Ⅎ𝑦𝜓)
32nfnd 1859 . . . 4 (𝜑 → Ⅎ𝑦 ¬ 𝜓)
4 cbvald.3 . . . . 5 (𝜑 → (𝑥 = 𝑦 → (𝜓𝜒)))
5 notbi 322 . . . . 5 ((𝜓𝜒) ↔ (¬ 𝜓 ↔ ¬ 𝜒))
64, 5syl6ib 254 . . . 4 (𝜑 → (𝑥 = 𝑦 → (¬ 𝜓 ↔ ¬ 𝜒)))
71, 3, 6cbvald 2430 . . 3 (𝜑 → (∀𝑥 ¬ 𝜓 ↔ ∀𝑦 ¬ 𝜒))
8 alnex 1783 . . 3 (∀𝑥 ¬ 𝜓 ↔ ¬ ∃𝑥𝜓)
9 alnex 1783 . . 3 (∀𝑦 ¬ 𝜒 ↔ ¬ ∃𝑦𝜒)
107, 8, 93bitr3g 316 . 2 (𝜑 → (¬ ∃𝑥𝜓 ↔ ¬ ∃𝑦𝜒))
1110con4bid 320 1 (𝜑 → (∃𝑥𝜓 ↔ ∃𝑦𝜒))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wal 1536  wex 1781  wnf 1785
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-11 2162  ax-12 2179  ax-13 2392
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-ex 1782  df-nf 1786
This theorem is referenced by:  cbvexdva  2433  vtoclgftOLD  3539  dfid3  5445  axrepndlem2  10002  axunnd  10005  axpowndlem2  10007  axpownd  10010  axregndlem2  10012  axinfndlem1  10014  axacndlem4  10019  wl-mo2df  34876  wl-eudf  34878
  Copyright terms: Public domain W3C validator