| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbccow | Structured version Visualization version GIF version | ||
| Description: A composition law for class substitution. Version of sbcco 3782 with a disjoint variable condition, which requires fewer axioms. (Contributed by NM, 26-Sep-2003.) Avoid ax-13 2371. (Revised by GG, 10-Jan-2024.) |
| Ref | Expression |
|---|---|
| sbccow | ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbcex 3766 | . 2 ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 → 𝐴 ∈ V) | |
| 2 | sbcex 3766 | . 2 ⊢ ([𝐴 / 𝑥]𝜑 → 𝐴 ∈ V) | |
| 3 | dfsbcq 3758 | . . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑦][𝑦 / 𝑥]𝜑)) | |
| 4 | dfsbcq 3758 | . . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)) | |
| 5 | sbsbc 3760 | . . . . . 6 ⊢ ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) | |
| 6 | 5 | sbbii 2077 | . . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑦][𝑦 / 𝑥]𝜑) |
| 7 | sbco2vv 2100 | . . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) | |
| 8 | sbsbc 3760 | . . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑦][𝑦 / 𝑥]𝜑) | |
| 9 | 6, 7, 8 | 3bitr3ri 302 | . . . 4 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) |
| 10 | sbsbc 3760 | . . . 4 ⊢ ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) | |
| 11 | 9, 10 | bitri 275 | . . 3 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) |
| 12 | 3, 4, 11 | vtoclbg 3526 | . 2 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)) |
| 13 | 1, 2, 12 | pm5.21nii 378 | 1 ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 [wsb 2065 ∈ wcel 2109 Vcvv 3450 [wsbc 3756 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-v 3452 df-sbc 3757 |
| This theorem is referenced by: sbc7 3788 sbccom 3837 sbcralt 3838 csbcow 3880 2nreu 4410 bnj62 34717 bnj610 34744 bnj976 34774 bnj1468 34843 sbccom2 38126 sbccom2f 38127 aomclem6 43055 |
| Copyright terms: Public domain | W3C validator |