Theorem sbccow 3743

Description: A composition law for class substitution. Version of sbcco 3746 with a disjoint variable condition, which requires fewer axioms. (Contributed by NM, 26-Sep-2003.) (Revised by Gino Giotto, 10-Jan-2024.)

Assertion

Ref	Expression
sbccow	⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)

Distinct variable groups:   𝜑,𝑦   𝑥,𝑦

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

Proof of Theorem sbccow

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sbcex 3730	. 2 ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 → 𝐴 ∈ V)
2		sbcex 3730	. 2 ⊢ ([𝐴 / 𝑥]𝜑 → 𝐴 ∈ V)
3		dfsbcq 3722	. . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑦][𝑦 / 𝑥]𝜑))
4		dfsbcq 3722	. . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
5		sbsbc 3724	. . . . . 6 ⊢ ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)
6	5	sbbii 2081	. . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑦][𝑦 / 𝑥]𝜑)
7		sbco2vv 2105	. . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑)
8		sbsbc 3724	. . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑦][𝑦 / 𝑥]𝜑)
9	6, 7, 8	3bitr3ri 305	. . . 4 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑)
10		sbsbc 3724	. . . 4 ⊢ ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑)
11	9, 10	bitri 278	. . 3 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑)
12	3, 4, 11	vtoclbg 3517	. 2 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
13	1, 2, 12	pm5.21nii 383	1 ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)

Syntax hints:   ↔ wb 209  [wsb 2069   ∈ wcel 2111  Vcvv 3441  [wsbc 3720

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-v 3443  df-sbc 3721

This theorem is referenced by:  sbc7  3751  sbccom  3800  sbcralt  3801  csbcow  3843  2nreu  4349  bnj62  32100  bnj610  32128  bnj976  32159  bnj1468  32228  aomclem6  40003