| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbcnestgf | Structured version Visualization version GIF version | ||
| Description: Nest the composition of two substitutions. Usage of this theorem is discouraged because it depends on ax-13 2401. Use the weaker sbcnestgfw 4379 when possible. (Contributed by Mario Carneiro, 11-Nov-2016.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sbcnestgf | ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑦Ⅎ𝑥𝜑) → ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝐴 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfsbcq 3741 | . . . . 5 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [𝐴 / 𝑥][𝐵 / 𝑦]𝜑)) | |
| 2 | csbeq1 3850 | . . . . . 6 ⊢ (𝑧 = 𝐴 → ⦋𝑧 / 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐵) | |
| 3 | 2 | sbceq1d 3744 | . . . . 5 ⊢ (𝑧 = 𝐴 → ([⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑 ↔ [⦋𝐴 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| 4 | 1, 3 | bibi12d 348 | . . . 4 ⊢ (𝑧 = 𝐴 → (([𝑧 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑) ↔ ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝐴 / 𝑥⦌𝐵 / 𝑦]𝜑))) |
| 5 | 4 | imbi2d 343 | . . 3 ⊢ (𝑧 = 𝐴 → ((∀𝑦Ⅎ𝑥𝜑 → ([𝑧 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑)) ↔ (∀𝑦Ⅎ𝑥𝜑 → ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝐴 / 𝑥⦌𝐵 / 𝑦]𝜑)))) |
| 6 | vex 3454 | . . . . 5 ⊢ 𝑧 ∈ V | |
| 7 | 6 | a1i 11 | . . . 4 ⊢ (∀𝑦Ⅎ𝑥𝜑 → 𝑧 ∈ V) |
| 8 | csbeq1a 3861 | . . . . . 6 ⊢ (𝑥 = 𝑧 → 𝐵 = ⦋𝑧 / 𝑥⦌𝐵) | |
| 9 | 8 | sbceq1d 3744 | . . . . 5 ⊢ (𝑥 = 𝑧 → ([𝐵 / 𝑦]𝜑 ↔ [⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| 10 | 9 | adantl 487 | . . . 4 ⊢ ((∀𝑦Ⅎ𝑥𝜑 ∧ 𝑥 = 𝑧) → ([𝐵 / 𝑦]𝜑 ↔ [⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| 11 | nfnf1 2191 | . . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝜑 | |
| 12 | 11 | nfal 2353 | . . . 4 ⊢ Ⅎ𝑥∀𝑦Ⅎ𝑥𝜑 |
| 13 | nfa1 2188 | . . . . 5 ⊢ Ⅎ𝑦∀𝑦Ⅎ𝑥𝜑 | |
| 14 | nfcsb1v 3871 | . . . . . 6 ⊢ Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐵 | |
| 15 | 14 | a1i 11 | . . . . 5 ⊢ (∀𝑦Ⅎ𝑥𝜑 → Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐵) |
| 16 | sp 2219 | . . . . 5 ⊢ (∀𝑦Ⅎ𝑥𝜑 → Ⅎ𝑥𝜑) | |
| 17 | 13, 15, 16 | nfsbcd 3763 | . . . 4 ⊢ (∀𝑦Ⅎ𝑥𝜑 → Ⅎ𝑥[⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑) |
| 18 | 7, 10, 12, 17 | sbciedf 3781 | . . 3 ⊢ (∀𝑦Ⅎ𝑥𝜑 → ([𝑧 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| 19 | 5, 18 | vtoclg 3517 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∀𝑦Ⅎ𝑥𝜑 → ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝐴 / 𝑥⦌𝐵 / 𝑦]𝜑))) |
| 20 | 19 | imp 412 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑦Ⅎ𝑥𝜑) → ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝐴 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2145 Ⅎwnfc 2907 Vcvv 3450 [wsbc 3739 ⦋csb 3847 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-13 2401 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-v 3452 df-sbc 3740 df-csb 3848 |
| This theorem is used by: csbnestgf 4385 sbcnestg 4386 |
| Copyright terms: Public domain | W3C validator |