| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sbcopeq1a | GIF version | ||
| Description: Equality theorem for substitution of a class for an ordered pair (analog of sbceq1a 3054 that avoids the existential quantifiers of copsexg 4362). (Contributed by NM, 19-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.) |
| Ref | Expression |
|---|---|
| sbcopeq1a | ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ([(1st ‘𝐴) / 𝑥][(2nd ‘𝐴) / 𝑦]𝜑 ↔ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 2818 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 2 | vex 2818 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 3 | 1, 2 | op2ndd 6345 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (2nd ‘𝐴) = 𝑦) |
| 4 | 3 | eqcomd 2240 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → 𝑦 = (2nd ‘𝐴)) |
| 5 | sbceq1a 3054 | . . 3 ⊢ (𝑦 = (2nd ‘𝐴) → (𝜑 ↔ [(2nd ‘𝐴) / 𝑦]𝜑)) | |
| 6 | 4, 5 | syl 14 | . 2 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝜑 ↔ [(2nd ‘𝐴) / 𝑦]𝜑)) |
| 7 | 1, 2 | op1std 6344 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (1st ‘𝐴) = 𝑥) |
| 8 | 7 | eqcomd 2240 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → 𝑥 = (1st ‘𝐴)) |
| 9 | sbceq1a 3054 | . . 3 ⊢ (𝑥 = (1st ‘𝐴) → ([(2nd ‘𝐴) / 𝑦]𝜑 ↔ [(1st ‘𝐴) / 𝑥][(2nd ‘𝐴) / 𝑦]𝜑)) | |
| 10 | 8, 9 | syl 14 | . 2 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ([(2nd ‘𝐴) / 𝑦]𝜑 ↔ [(1st ‘𝐴) / 𝑥][(2nd ‘𝐴) / 𝑦]𝜑)) |
| 11 | 6, 10 | bitr2d 189 | 1 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ([(1st ‘𝐴) / 𝑥][(2nd ‘𝐴) / 𝑦]𝜑 ↔ 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 [wsbc 3044 〈cop 3694 ‘cfv 5354 1st c1st 6334 2nd c2nd 6335 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-rex 2528 df-v 2817 df-sbc 3045 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-iota 5314 df-fun 5356 df-fv 5362 df-1st 6336 df-2nd 6337 |
| This theorem is referenced by: dfopab2 6385 dfoprab3s 6386 |
| Copyright terms: Public domain | W3C validator |