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

Theorem rabbidaOLD 3433
Description: Obsolete version of rabbida 3421 as of 14-Mar-2025. (Contributed by BJ, 27-Apr-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
rabbidaOLD.n 𝑥𝜑
rabbidaOLD.1 ((𝜑𝑥𝐴) → (𝜓𝜒))
Assertion
Ref Expression
rabbidaOLD (𝜑 → {𝑥𝐴𝜓} = {𝑥𝐴𝜒})

Proof of Theorem rabbidaOLD
StepHypRef Expression
1 rabbidaOLD.n . . 3 𝑥𝜑
2 rabbidaOLD.1 . . . 4 ((𝜑𝑥𝐴) → (𝜓𝜒))
32ex 412 . . 3 (𝜑 → (𝑥𝐴 → (𝜓𝜒)))
41, 3ralrimi 3230 . 2 (𝜑 → ∀𝑥𝐴 (𝜓𝜒))
5 rabbi 3425 . 2 (∀𝑥𝐴 (𝜓𝜒) ↔ {𝑥𝐴𝜓} = {𝑥𝐴𝜒})
64, 5sylib 218 1 (𝜑 → {𝑥𝐴𝜓} = {𝑥𝐴𝜒})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wnf 1784  wcel 2111  wral 3047  {crab 3395
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2710  df-cleq 2723  df-ral 3048  df-rab 3396
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator