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

Theorem ceqsralv 3533
Description: Restricted quantifier version of ceqsalv 3532. (Contributed by NM, 21-Jun-2013.)
Hypothesis
Ref Expression
ceqsralv.2 (𝑥 = 𝐴 → (𝜑𝜓))
Assertion
Ref Expression
ceqsralv (𝐴𝐵 → (∀𝑥𝐵 (𝑥 = 𝐴𝜑) ↔ 𝜓))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜓,𝑥
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem ceqsralv
StepHypRef Expression
1 nfv 1911 . 2 𝑥𝜓
2 ceqsralv.2 . . 3 (𝑥 = 𝐴 → (𝜑𝜓))
32ax-gen 1792 . 2 𝑥(𝑥 = 𝐴 → (𝜑𝜓))
4 ceqsralt 3528 . 2 ((Ⅎ𝑥𝜓 ∧ ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) ∧ 𝐴𝐵) → (∀𝑥𝐵 (𝑥 = 𝐴𝜑) ↔ 𝜓))
51, 3, 4mp3an12 1447 1 (𝐴𝐵 → (∀𝑥𝐵 (𝑥 = 𝐴𝜑) ↔ 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wal 1531   = wceq 1533  wnf 1780  wcel 2110  wral 3138
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-12 2173  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-3an 1085  df-ex 1777  df-nf 1781  df-cleq 2814  df-clel 2893  df-ral 3143
This theorem is referenced by:  eqreu  3719  sqrt2irr  15596  acsfn  16924  ovolgelb  24075
  Copyright terms: Public domain W3C validator