Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > sbccomieg | Structured version Visualization version GIF version |
Description: Commute two explicit substitutions, using an implicit substitution to rewrite the exiting substitution. (Contributed by Stefan O'Rear, 11-Oct-2014.) (Revised by Mario Carneiro, 11-Dec-2016.) |
Ref | Expression |
---|---|
sbccomieg.1 | ⊢ (𝑎 = 𝐴 → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
sbccomieg | ⊢ ([𝐴 / 𝑎][𝐵 / 𝑏]𝜑 ↔ [𝐶 / 𝑏][𝐴 / 𝑎]𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbcex 3782 | . 2 ⊢ ([𝐴 / 𝑎][𝐵 / 𝑏]𝜑 → 𝐴 ∈ V) | |
2 | spesbc 3865 | . . 3 ⊢ ([𝐶 / 𝑏][𝐴 / 𝑎]𝜑 → ∃𝑏[𝐴 / 𝑎]𝜑) | |
3 | sbcex 3782 | . . . 4 ⊢ ([𝐴 / 𝑎]𝜑 → 𝐴 ∈ V) | |
4 | 3 | exlimiv 1931 | . . 3 ⊢ (∃𝑏[𝐴 / 𝑎]𝜑 → 𝐴 ∈ V) |
5 | 2, 4 | syl 17 | . 2 ⊢ ([𝐶 / 𝑏][𝐴 / 𝑎]𝜑 → 𝐴 ∈ V) |
6 | nfcv 2977 | . . . 4 ⊢ Ⅎ𝑎𝐶 | |
7 | nfsbc1v 3792 | . . . 4 ⊢ Ⅎ𝑎[𝐴 / 𝑎]𝜑 | |
8 | 6, 7 | nfsbcw 3794 | . . 3 ⊢ Ⅎ𝑎[𝐶 / 𝑏][𝐴 / 𝑎]𝜑 |
9 | sbccomieg.1 | . . . 4 ⊢ (𝑎 = 𝐴 → 𝐵 = 𝐶) | |
10 | sbceq1a 3783 | . . . 4 ⊢ (𝑎 = 𝐴 → (𝜑 ↔ [𝐴 / 𝑎]𝜑)) | |
11 | 9, 10 | sbceqbid 3779 | . . 3 ⊢ (𝑎 = 𝐴 → ([𝐵 / 𝑏]𝜑 ↔ [𝐶 / 𝑏][𝐴 / 𝑎]𝜑)) |
12 | 8, 11 | sbciegf 3809 | . 2 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑎][𝐵 / 𝑏]𝜑 ↔ [𝐶 / 𝑏][𝐴 / 𝑎]𝜑)) |
13 | 1, 5, 12 | pm5.21nii 382 | 1 ⊢ ([𝐴 / 𝑎][𝐵 / 𝑏]𝜑 ↔ [𝐶 / 𝑏][𝐴 / 𝑎]𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1537 ∃wex 1780 ∈ wcel 2114 Vcvv 3494 [wsbc 3772 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-v 3496 df-sbc 3773 |
This theorem is referenced by: 2rexfrabdioph 39413 3rexfrabdioph 39414 4rexfrabdioph 39415 6rexfrabdioph 39416 7rexfrabdioph 39417 |
Copyright terms: Public domain | W3C validator |