 Mathbox for BJ < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-eqs Structured version   Visualization version   GIF version

Theorem bj-eqs 33169
 Description: A lemma for substitutions, proved from Tarski's FOL. The version without DV(x,y) is true but requires ax-13 2377. The disjoint variable condition DV(x,ph) is necessary for both directions: consider substituting 𝑥 = 𝑧 for 𝜑. (Contributed by BJ, 25-May-2021.)
Assertion
Ref Expression
bj-eqs (𝜑 ↔ ∀𝑥(𝑥 = 𝑦𝜑))
Distinct variable groups:   𝑥,𝑦   𝜑,𝑥
Allowed substitution hint:   𝜑(𝑦)

Proof of Theorem bj-eqs
StepHypRef Expression
1 ax-1 6 . . 3 (𝜑 → (𝑥 = 𝑦𝜑))
21alrimiv 2023 . 2 (𝜑 → ∀𝑥(𝑥 = 𝑦𝜑))
3 exim 1929 . . 3 (∀𝑥(𝑥 = 𝑦𝜑) → (∃𝑥 𝑥 = 𝑦 → ∃𝑥𝜑))
4 ax6ev 2074 . . . 4 𝑥 𝑥 = 𝑦
5 pm2.27 42 . . . 4 (∃𝑥 𝑥 = 𝑦 → ((∃𝑥 𝑥 = 𝑦 → ∃𝑥𝜑) → ∃𝑥𝜑))
64, 5ax-mp 5 . . 3 ((∃𝑥 𝑥 = 𝑦 → ∃𝑥𝜑) → ∃𝑥𝜑)
7 ax5e 2008 . . 3 (∃𝑥𝜑𝜑)
83, 6, 73syl 18 . 2 (∀𝑥(𝑥 = 𝑦𝜑) → 𝜑)
92, 8impbii 201 1 (𝜑 ↔ ∀𝑥(𝑥 = 𝑦𝜑))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 198  ∀wal 1651  ∃wex 1875 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072 This theorem depends on definitions:  df-bi 199  df-ex 1876 This theorem is referenced by:  bj-sb  33183
 Copyright terms: Public domain W3C validator