| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > opeq12 | GIF version | ||
| Description: Equality theorem for ordered pairs. (Contributed by NM, 28-May-1995.) |
| Ref | Expression |
|---|---|
| opeq12 | ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opeq1 3857 | . 2 ⊢ (𝐴 = 𝐶 → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐵〉) | |
| 2 | opeq2 3858 | . 2 ⊢ (𝐵 = 𝐷 → 〈𝐶, 𝐵〉 = 〈𝐶, 𝐷〉) | |
| 3 | 1, 2 | sylan9eq 2282 | 1 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 〈cop 3669 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-v 2801 df-un 3201 df-sn 3672 df-pr 3673 df-op 3675 |
| This theorem is referenced by: opeq12i 3862 opeq12d 3865 cbvopab 4155 opth 4323 copsex2t 4331 copsex2g 4332 relop 4872 funopg 5352 fsn 5809 fnressn 5829 cbvoprab12 6084 eqopi 6324 f1o2ndf1 6380 tposoprab 6432 brecop 6780 th3q 6795 ecovcom 6797 ecovicom 6798 ecovass 6799 ecoviass 6800 ecovdi 6801 ecovidi 6802 xpf1o 7013 1qec 7586 enq0sym 7630 addnq0mo 7645 mulnq0mo 7646 addnnnq0 7647 mulnnnq0 7648 distrnq0 7657 mulcomnq0 7658 addassnq0 7660 addsrmo 7941 mulsrmo 7942 addsrpr 7943 mulsrpr 7944 axcnre 8079 fsumcnv 11963 fprodcnv 12151 eucalgval2 12590 |
| Copyright terms: Public domain | W3C validator |