Theorem sbcom2v2 1961

Description: Lemma for proving sbcom2 1962. It is the same as sbcom2v 1960 but removes the distinct variable constraint on 𝑥 and 𝑦. (Contributed by Jim Kingdon, 19-Feb-2018.)

Assertion

Ref	Expression
sbcom2v2	⊢ ([𝑤 / 𝑧][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑤 / 𝑧]𝜑)

Distinct variable groups:   𝑥,𝑤,𝑧   𝑦,𝑧

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

Proof of Theorem sbcom2v2

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sbcom2v 1960	. . 3 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑣][𝑤 / 𝑧][𝑣 / 𝑥]𝜑)
2		sbcom2v 1960	. . . 4 ⊢ ([𝑤 / 𝑧][𝑣 / 𝑥]𝜑 ↔ [𝑣 / 𝑥][𝑤 / 𝑧]𝜑)
3	2	sbbii 1738	. . 3 ⊢ ([𝑦 / 𝑣][𝑤 / 𝑧][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑣][𝑣 / 𝑥][𝑤 / 𝑧]𝜑)
4	1, 3	bitri 183	. 2 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑣][𝑣 / 𝑥][𝑤 / 𝑧]𝜑)
5		ax-17 1506	. . . 4 ⊢ (𝜑 → ∀𝑣𝜑)
6	5	sbco2vh 1918	. . 3 ⊢ ([𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)
7	6	sbbii 1738	. 2 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑣][𝑣 / 𝑥]𝜑 ↔ [𝑤 / 𝑧][𝑦 / 𝑥]𝜑)
8		ax-17 1506	. . 3 ⊢ ([𝑤 / 𝑧]𝜑 → ∀𝑣[𝑤 / 𝑧]𝜑)
9	8	sbco2vh 1918	. 2 ⊢ ([𝑦 / 𝑣][𝑣 / 𝑥][𝑤 / 𝑧]𝜑 ↔ [𝑦 / 𝑥][𝑤 / 𝑧]𝜑)
10	4, 7, 9	3bitr3i 209	1 ⊢ ([𝑤 / 𝑧][𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥][𝑤 / 𝑧]𝜑)

Syntax hints:   ↔ wb 104  [wsb 1735

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515

This theorem depends on definitions:  df-bi 116  df-nf 1437  df-sb 1736

This theorem is referenced by:  sbcom2  1962