Theorem sbal1 1933

Description: A theorem used in elimination of disjoint variable conditions on 𝑥, 𝑦 by replacing it with a distinctor ¬ ∀𝑥𝑥 = 𝑧. (Contributed by NM, 5-Aug-1993.) (Proof rewitten by Jim Kingdon, 24-Feb-2018.)

Assertion

Ref	Expression
sbal1	⊢ (¬ ∀𝑥 𝑥 = 𝑧 → ([𝑧 / 𝑦]∀𝑥𝜑 ↔ ∀𝑥[𝑧 / 𝑦]𝜑))

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)

Proof of Theorem sbal1

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sbal 1931	. . . 4 ⊢ ([𝑤 / 𝑦]∀𝑥𝜑 ↔ ∀𝑥[𝑤 / 𝑦]𝜑)
2	1	sbbii 1702	. . 3 ⊢ ([𝑧 / 𝑤][𝑤 / 𝑦]∀𝑥𝜑 ↔ [𝑧 / 𝑤]∀𝑥[𝑤 / 𝑦]𝜑)
3		sbal1yz 1932	. . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑧 → ([𝑧 / 𝑤]∀𝑥[𝑤 / 𝑦]𝜑 ↔ ∀𝑥[𝑧 / 𝑤][𝑤 / 𝑦]𝜑))
4	2, 3	syl5bb 191	. 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑧 → ([𝑧 / 𝑤][𝑤 / 𝑦]∀𝑥𝜑 ↔ ∀𝑥[𝑧 / 𝑤][𝑤 / 𝑦]𝜑))
5		ax-17 1471	. . 3 ⊢ (∀𝑥𝜑 → ∀𝑤∀𝑥𝜑)
6	5	sbco2v 1876	. 2 ⊢ ([𝑧 / 𝑤][𝑤 / 𝑦]∀𝑥𝜑 ↔ [𝑧 / 𝑦]∀𝑥𝜑)
7		ax-17 1471	. . . 4 ⊢ (𝜑 → ∀𝑤𝜑)
8	7	sbco2v 1876	. . 3 ⊢ ([𝑧 / 𝑤][𝑤 / 𝑦]𝜑 ↔ [𝑧 / 𝑦]𝜑)
9	8	albii 1411	. 2 ⊢ (∀𝑥[𝑧 / 𝑤][𝑤 / 𝑦]𝜑 ↔ ∀𝑥[𝑧 / 𝑦]𝜑)
10	4, 6, 9	3bitr3g 221	1 ⊢ (¬ ∀𝑥 𝑥 = 𝑧 → ([𝑧 / 𝑦]∀𝑥𝜑 ↔ ∀𝑥[𝑧 / 𝑦]𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 104  ∀wal 1294  [wsb 1699

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in2 583  ax-io 668  ax-5 1388  ax-7 1389  ax-gen 1390  ax-ie1 1434  ax-ie2 1435  ax-8 1447  ax-10 1448  ax-11 1449  ax-i12 1450  ax-bndl 1451  ax-4 1452  ax-17 1471  ax-i9 1475  ax-ial 1479  ax-i5r 1480

This theorem depends on definitions:  df-bi 116  df-nf 1402  df-sb 1700

This theorem is referenced by: (None)