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

Theorem bj-ssbeq 31816
Description: Substitution in an equality, disjoint variables case. Might be shorter to prove the result about composition of two substitutions and prove this first with a DV on x,t and then in the general case. (Contributed by BJ, 22-Dec-2020.)
Assertion
Ref Expression
bj-ssbeq ([𝑡/𝑥]b𝑦 = 𝑧𝑦 = 𝑧)
Distinct variable groups:   𝑥,𝑦   𝑥,𝑧

Proof of Theorem bj-ssbeq
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 df-ssb 31809 . 2 ([𝑡/𝑥]b𝑦 = 𝑧 ↔ ∀𝑢(𝑢 = 𝑡 → ∀𝑥(𝑥 = 𝑢𝑦 = 𝑧)))
2 19.23v 1889 . . . . . 6 (∀𝑥(𝑥 = 𝑢𝑦 = 𝑧) ↔ (∃𝑥 𝑥 = 𝑢𝑦 = 𝑧))
3 ax6ev 1877 . . . . . . . 8 𝑥 𝑥 = 𝑢
4 pm2.27 41 . . . . . . . 8 (∃𝑥 𝑥 = 𝑢 → ((∃𝑥 𝑥 = 𝑢𝑦 = 𝑧) → 𝑦 = 𝑧))
53, 4ax-mp 5 . . . . . . 7 ((∃𝑥 𝑥 = 𝑢𝑦 = 𝑧) → 𝑦 = 𝑧)
6 ax-1 6 . . . . . . 7 (𝑦 = 𝑧 → (∃𝑥 𝑥 = 𝑢𝑦 = 𝑧))
75, 6impbii 198 . . . . . 6 ((∃𝑥 𝑥 = 𝑢𝑦 = 𝑧) ↔ 𝑦 = 𝑧)
82, 7bitri 263 . . . . 5 (∀𝑥(𝑥 = 𝑢𝑦 = 𝑧) ↔ 𝑦 = 𝑧)
98imbi2i 325 . . . 4 ((𝑢 = 𝑡 → ∀𝑥(𝑥 = 𝑢𝑦 = 𝑧)) ↔ (𝑢 = 𝑡𝑦 = 𝑧))
109albii 1737 . . 3 (∀𝑢(𝑢 = 𝑡 → ∀𝑥(𝑥 = 𝑢𝑦 = 𝑧)) ↔ ∀𝑢(𝑢 = 𝑡𝑦 = 𝑧))
11 19.23v 1889 . . . 4 (∀𝑢(𝑢 = 𝑡𝑦 = 𝑧) ↔ (∃𝑢 𝑢 = 𝑡𝑦 = 𝑧))
12 ax6ev 1877 . . . . . 6 𝑢 𝑢 = 𝑡
13 pm2.27 41 . . . . . 6 (∃𝑢 𝑢 = 𝑡 → ((∃𝑢 𝑢 = 𝑡𝑦 = 𝑧) → 𝑦 = 𝑧))
1412, 13ax-mp 5 . . . . 5 ((∃𝑢 𝑢 = 𝑡𝑦 = 𝑧) → 𝑦 = 𝑧)
15 ax-1 6 . . . . 5 (𝑦 = 𝑧 → (∃𝑢 𝑢 = 𝑡𝑦 = 𝑧))
1614, 15impbii 198 . . . 4 ((∃𝑢 𝑢 = 𝑡𝑦 = 𝑧) ↔ 𝑦 = 𝑧)
1711, 16bitri 263 . . 3 (∀𝑢(𝑢 = 𝑡𝑦 = 𝑧) ↔ 𝑦 = 𝑧)
1810, 17bitri 263 . 2 (∀𝑢(𝑢 = 𝑡 → ∀𝑥(𝑥 = 𝑢𝑦 = 𝑧)) ↔ 𝑦 = 𝑧)
191, 18bitri 263 1 ([𝑡/𝑥]b𝑦 = 𝑧𝑦 = 𝑧)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wal 1473  wex 1695  [wssb 31808
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875
This theorem depends on definitions:  df-bi 196  df-ex 1696  df-ssb 31809
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator