| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbcopeq1a | Structured version Visualization version GIF version | ||
| Description: Equality theorem for substitution of a class for an ordered pair (analogue of sbceq1a 3753 that avoids the existential quantifiers of copsexg 5467). (Contributed by NM, 19-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.) |
| Ref | Expression |
|---|---|
| sbcopeq1a | ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ([(1st ‘𝐴) / 𝑥][(2nd ‘𝐴) / 𝑦]𝜑 ↔ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 3458 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 2 | vex 3458 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 3 | 1, 2 | op2ndd 8039 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (2nd ‘𝐴) = 𝑦) |
| 4 | 3 | eqcomd 2769 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → 𝑦 = (2nd ‘𝐴)) |
| 5 | sbceq1a 3753 | . . 3 ⊢ (𝑦 = (2nd ‘𝐴) → (𝜑 ↔ [(2nd ‘𝐴) / 𝑦]𝜑)) | |
| 6 | 4, 5 | syl 18 | . 2 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝜑 ↔ [(2nd ‘𝐴) / 𝑦]𝜑)) |
| 7 | 1, 2 | op1std 8038 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (1st ‘𝐴) = 𝑥) |
| 8 | 7 | eqcomd 2769 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → 𝑥 = (1st ‘𝐴)) |
| 9 | sbceq1a 3753 | . . 3 ⊢ (𝑥 = (1st ‘𝐴) → ([(2nd ‘𝐴) / 𝑦]𝜑 ↔ [(1st ‘𝐴) / 𝑥][(2nd ‘𝐴) / 𝑦]𝜑)) | |
| 10 | 8, 9 | syl 18 | . 2 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ([(2nd ‘𝐴) / 𝑦]𝜑 ↔ [(1st ‘𝐴) / 𝑥][(2nd ‘𝐴) / 𝑦]𝜑)) |
| 11 | 6, 10 | bitr2d 283 | 1 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ([(1st ‘𝐴) / 𝑥][(2nd ‘𝐴) / 𝑦]𝜑 ↔ 𝜑)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 [wsbc 3742 〈cop 4838 ‘cfv 6561 1st c1st 8026 2nd c2nd 8027 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pr 5396 ax-un 7778 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-iota 6515 df-fun 6563 df-fv 6569 df-1st 8028 df-2nd 8029 |
| This theorem is used by: dfopab2 8091 dfoprab3s 8092 ralxpes 8183 frpoins3xpg 8187 |
| Copyright terms: Public domain | W3C validator |