| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > opeq12i | GIF version | ||
| Description: Equality inference for ordered pairs. (Contributed by NM, 16-Dec-2006.) (Proof shortened by Eric Schmidt, 4-Apr-2007.) |
| Ref | Expression |
|---|---|
| opeq1i.1 | ⊢ 𝐴 = 𝐵 |
| opeq12i.2 | ⊢ 𝐶 = 𝐷 |
| Ref | Expression |
|---|---|
| opeq12i | ⊢ 〈𝐴, 𝐶〉 = 〈𝐵, 𝐷〉 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opeq1i.1 | . 2 ⊢ 𝐴 = 𝐵 | |
| 2 | opeq12i.2 | . 2 ⊢ 𝐶 = 𝐷 | |
| 3 | opeq12 3864 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → 〈𝐴, 𝐶〉 = 〈𝐵, 𝐷〉) | |
| 4 | 1, 2, 3 | mp2an 426 | 1 ⊢ 〈𝐴, 𝐶〉 = 〈𝐵, 𝐷〉 |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1397 〈cop 3672 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 df-un 3204 df-sn 3675 df-pr 3676 df-op 3678 |
| This theorem is referenced by: addpinq1 7683 genipv 7728 ltexpri 7832 recexpr 7857 cauappcvgprlemladdru 7875 cauappcvgprlemladdrl 7876 cauappcvgpr 7881 caucvgprlemcl 7895 caucvgprlemladdrl 7897 caucvgpr 7901 caucvgprprlemval 7907 caucvgprprlemnbj 7912 caucvgprprlemmu 7914 caucvgprprlemclphr 7924 caucvgprprlemaddq 7927 caucvgprprlem1 7928 caucvgprprlem2 7929 caucvgsr 8021 pitonnlem1 8064 axi2m1 8094 axcaucvg 8119 |
| Copyright terms: Public domain | W3C validator |