| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Equality theorem for ordered pairs. |
| Ref | Expression |
|---|---|
| opeq12 | ⊢ ((A = C ∧ B = D) → 〈A, B〉 = 〈C, D〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opeq1 1876 | . 2 ⊢ (A = C → 〈A, B〉 = 〈C, B〉) | |
| 2 | opeq2 1877 | . 2 ⊢ (B = D → 〈C, B〉 = 〈C, D〉) | |
| 3 | 1, 2 | sylan9eq 1144 | 1 ⊢ ((A = C ∧ B = D) → 〈A, B〉 = 〈C, D〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 2 ∧ wa 196 = wceq 1091 〈cop 1810 |
| This theorem is referenced by: opth 1898 copsex2g 1903 cbvopab 2104 opabsb 2114 opelopabg 2115 fsn 2895 fnressn 2897 cbvoprab12 3028 elxp6 3093 brecop 3242 th3q 3253 ecoprcom 3255 ecoprass 3256 ecoprdi 3257 xpassen 3344 xpmapenlem3 3393 mapunen 3397 addpipq 3848 mulpipq 3849 1qec 3862 mulidpq 3863 halfpq 3876 prlem934a 3931 prlem934b 3932 addsrpr 3978 mulsrpr 3979 addcnsr 4047 mulcnsr 4048 mulresr 4051 ax0id 4076 ax1id 4077 axnegex 4078 axrecex 4079 axcnre 4087 seqlem1 4662 seqrval 4664 seqsuclem 4669 ruclem4 4888 ruclem15 4899 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-16 922 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-v 1349 df-un 1490 df-sn 1811 df-pr 1812 df-op 1815 |