Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sbcco | Structured version Visualization version GIF version |
Description: A composition law for class substitution. Usage of this theorem is discouraged because it depends on ax-13 2371. Use the weaker sbccow 3702 when possible. (Contributed by NM, 26-Sep-2003.) (Revised by Mario Carneiro, 13-Oct-2016.) (New usage is discouraged.) |
Ref | Expression |
---|---|
sbcco | ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbcex 3689 | . 2 ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 → 𝐴 ∈ V) | |
2 | sbcex 3689 | . 2 ⊢ ([𝐴 / 𝑥]𝜑 → 𝐴 ∈ V) | |
3 | dfsbcq 3681 | . . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑦][𝑦 / 𝑥]𝜑)) | |
4 | dfsbcq 3681 | . . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)) | |
5 | sbsbc 3683 | . . . . . 6 ⊢ ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) | |
6 | 5 | sbbii 2085 | . . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑦][𝑦 / 𝑥]𝜑) |
7 | nfv 1920 | . . . . . 6 ⊢ Ⅎ𝑦𝜑 | |
8 | 7 | sbco2 2515 | . . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) |
9 | sbsbc 3683 | . . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑦][𝑦 / 𝑥]𝜑) | |
10 | 6, 8, 9 | 3bitr3ri 305 | . . . 4 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) |
11 | sbsbc 3683 | . . . 4 ⊢ ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) | |
12 | 10, 11 | bitri 278 | . . 3 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) |
13 | 3, 4, 12 | vtoclbg 3472 | . 2 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)) |
14 | 1, 2, 13 | pm5.21nii 383 | 1 ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 [wsb 2073 ∈ wcel 2113 Vcvv 3397 [wsbc 3679 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1916 ax-6 1974 ax-7 2019 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2161 ax-12 2178 ax-13 2371 ax-ext 2710 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-tru 1545 df-ex 1787 df-nf 1791 df-sb 2074 df-clab 2717 df-cleq 2730 df-clel 2811 df-v 3399 df-sbc 3680 |
This theorem is referenced by: csbco 3804 sbccom2 35895 sbccom2f 35896 |
Copyright terms: Public domain | W3C validator |