![]() |
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 3830 with a disjoint variable condition, which requires fewer axioms. (Contributed by NM, 26-Sep-2003.) Avoid ax-13 2380. (Revised by GG, 10-Jan-2024.) |
Ref | Expression |
---|---|
sbccow | ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbcex 3814 | . 2 ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 → 𝐴 ∈ V) | |
2 | sbcex 3814 | . 2 ⊢ ([𝐴 / 𝑥]𝜑 → 𝐴 ∈ V) | |
3 | dfsbcq 3806 | . . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑦][𝑦 / 𝑥]𝜑)) | |
4 | dfsbcq 3806 | . . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)) | |
5 | sbsbc 3808 | . . . . . 6 ⊢ ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑) | |
6 | 5 | sbbii 2076 | . . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑦][𝑦 / 𝑥]𝜑) |
7 | sbco2vv 2099 | . . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) | |
8 | sbsbc 3808 | . . . . 5 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑦][𝑦 / 𝑥]𝜑) | |
9 | 6, 7, 8 | 3bitr3ri 302 | . . . 4 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) |
10 | sbsbc 3808 | . . . 4 ⊢ ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) | |
11 | 9, 10 | bitri 275 | . . 3 ⊢ ([𝑧 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝑧 / 𝑥]𝜑) |
12 | 3, 4, 11 | vtoclbg 3569 | . 2 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)) |
13 | 1, 2, 12 | pm5.21nii 378 | 1 ⊢ ([𝐴 / 𝑦][𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 [wsb 2064 ∈ wcel 2108 Vcvv 3488 [wsbc 3804 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1540 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-v 3490 df-sbc 3805 |
This theorem is referenced by: sbc7 3837 sbccom 3893 sbcralt 3894 csbcow 3936 2nreu 4467 bnj62 34696 bnj610 34723 bnj976 34753 bnj1468 34822 sbccom2 38085 sbccom2f 38086 aomclem6 43016 |
Copyright terms: Public domain | W3C validator |