| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > opeq2d | GIF version | ||
| Description: Equality deduction for ordered pairs. (Contributed by NM, 16-Dec-2006.) |
| Ref | Expression |
|---|---|
| opeq1d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| opeq2d | ⊢ (𝜑 → 〈𝐶, 𝐴〉 = 〈𝐶, 𝐵〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opeq1d.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | opeq2 3858 | . 2 ⊢ (𝐴 = 𝐵 → 〈𝐶, 𝐴〉 = 〈𝐶, 𝐵〉) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → 〈𝐶, 𝐴〉 = 〈𝐶, 𝐵〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = 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: tfr1onlemaccex 6500 tfrcllemaccex 6513 fundmen 6967 exmidapne 7457 recexnq 7588 suplocexprlemex 7920 elreal2 8028 frecuzrdgrrn 10642 frec2uzrdg 10643 frecuzrdgrcl 10644 frecuzrdgsuc 10648 frecuzrdgrclt 10649 frecuzrdgg 10650 frecuzrdgsuctlem 10657 seqeq2 10685 seqeq3 10686 iseqvalcbv 10693 seq3val 10694 seqvalcd 10695 s1val 11165 s1eq 11167 s1prc 11171 swrdlsw 11216 pfxpfx 11255 swrdccat 11282 swrdccat3blem 11286 swrdccat3b 11287 pfxccatin12d 11292 eucalgval 12591 ennnfonelemp1 12992 ennnfonelemnn0 13008 strsetsid 13080 ressvalsets 13112 strressid 13119 ressinbasd 13122 ressressg 13123 prdsex 13317 prdsval 13321 imasex 13353 imasival 13354 imasaddvallemg 13363 xpsfval 13396 xpsval 13400 mgpvalg 13901 mgpress 13909 ring1 14037 opprvalg 14047 sraval 14416 zlmval 14606 znval 14615 znval2 14617 psrval 14645 |
| Copyright terms: Public domain | W3C validator |