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

Theorem ceqsal 3230
Description: A representation of explicit substitution of a class for a variable, inferred from an implicit substitution hypothesis. (Contributed by NM, 18-Aug-1993.)
Hypotheses
Ref Expression
ceqsal.1 𝑥𝜓
ceqsal.2 𝐴 ∈ V
ceqsal.3 (𝑥 = 𝐴 → (𝜑𝜓))
Assertion
Ref Expression
ceqsal (∀𝑥(𝑥 = 𝐴𝜑) ↔ 𝜓)
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem ceqsal
StepHypRef Expression
1 ceqsal.2 . 2 𝐴 ∈ V
2 ceqsal.1 . . 3 𝑥𝜓
3 ceqsal.3 . . 3 (𝑥 = 𝐴 → (𝜑𝜓))
42, 3ceqsalg 3228 . 2 (𝐴 ∈ V → (∀𝑥(𝑥 = 𝐴𝜑) ↔ 𝜓))
51, 4ax-mp 5 1 (∀𝑥(𝑥 = 𝐴𝜑) ↔ 𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wal 1480   = wceq 1482  wnf 1707  wcel 1989  Vcvv 3198
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1721  ax-4 1736  ax-5 1838  ax-6 1887  ax-7 1934  ax-9 1998  ax-12 2046  ax-ext 2601
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1485  df-ex 1704  df-nf 1709  df-sb 1880  df-clab 2608  df-cleq 2614  df-clel 2617  df-v 3200
This theorem is referenced by:  ceqsalv  3231  aomclem6  37455
  Copyright terms: Public domain W3C validator