| 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 2404. Use the weaker sbcnestgfw 4381 when possible. (Contributed by Mario Carneiro, 11-Nov-2016.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sbcnestgf | ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑦Ⅎ𝑥𝜑) → ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝐴 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfsbcq 3743 | . . . . 5 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [𝐴 / 𝑥][𝐵 / 𝑦]𝜑)) | |
| 2 | csbeq1 3853 | . . . . . 6 ⊢ (𝑧 = 𝐴 → ⦋𝑧 / 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐵) | |
| 3 | 2 | sbceq1d 3746 | . . . . 5 ⊢ (𝑧 = 𝐴 → ([⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑 ↔ [⦋𝐴 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| 4 | 1, 3 | bibi12d 348 | . . . 4 ⊢ (𝑧 = 𝐴 → (([𝑧 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑) ↔ ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝐴 / 𝑥⦌𝐵 / 𝑦]𝜑))) |
| 5 | 4 | imbi2d 343 | . . 3 ⊢ (𝑧 = 𝐴 → ((∀𝑦Ⅎ𝑥𝜑 → ([𝑧 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑)) ↔ (∀𝑦Ⅎ𝑥𝜑 → ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝐴 / 𝑥⦌𝐵 / 𝑦]𝜑)))) |
| 6 | vex 3457 | . . . . 5 ⊢ 𝑧 ∈ V | |
| 7 | 6 | a1i 11 | . . . 4 ⊢ (∀𝑦Ⅎ𝑥𝜑 → 𝑧 ∈ V) |
| 8 | csbeq1a 3864 | . . . . . 6 ⊢ (𝑥 = 𝑧 → 𝐵 = ⦋𝑧 / 𝑥⦌𝐵) | |
| 9 | 8 | sbceq1d 3746 | . . . . 5 ⊢ (𝑥 = 𝑧 → ([𝐵 / 𝑦]𝜑 ↔ [⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| 10 | 9 | adantl 487 | . . . 4 ⊢ ((∀𝑦Ⅎ𝑥𝜑 ∧ 𝑥 = 𝑧) → ([𝐵 / 𝑦]𝜑 ↔ [⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| 11 | nfnf1 2193 | . . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝜑 | |
| 12 | 11 | nfal 2356 | . . . 4 ⊢ Ⅎ𝑥∀𝑦Ⅎ𝑥𝜑 |
| 13 | nfa1 2190 | . . . . 5 ⊢ Ⅎ𝑦∀𝑦Ⅎ𝑥𝜑 | |
| 14 | nfcsb1v 3874 | . . . . . 6 ⊢ Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐵 | |
| 15 | 14 | a1i 11 | . . . . 5 ⊢ (∀𝑦Ⅎ𝑥𝜑 → Ⅎ𝑥⦋𝑧 / 𝑥⦌𝐵) |
| 16 | sp 2222 | . . . . 5 ⊢ (∀𝑦Ⅎ𝑥𝜑 → Ⅎ𝑥𝜑) | |
| 17 | 13, 15, 16 | nfsbcd 3765 | . . . 4 ⊢ (∀𝑦Ⅎ𝑥𝜑 → Ⅎ𝑥[⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑) |
| 18 | 7, 10, 12, 17 | sbciedf 3783 | . . 3 ⊢ (∀𝑦Ⅎ𝑥𝜑 → ([𝑧 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [⦋𝑧 / 𝑥⦌𝐵 / 𝑦]𝜑)) |
| 19 | 5, 18 | vtoclg 3520 | . 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 1567 = wceq 1569 Ⅎwnf 1815 ∈ wcel 2146 Ⅎwnfc 2910 Vcvv 3453 [wsbc 3741 ⦋csb 3850 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-13 2404 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-ex 1812 df-nf 1816 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-v 3455 df-sbc 3742 df-csb 3851 |
| This theorem is used by: csbnestgf 4387 sbcnestg 4388 |
| Copyright terms: Public domain | W3C validator |