| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rneqd | GIF version | ||
| Description: Equality deduction for range. (Contributed by NM, 4-Mar-2004.) |
| Ref | Expression |
|---|---|
| rneqd.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| rneqd | ⊢ (𝜑 → ran 𝐴 = ran 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rneqd.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | rneq 5011 | . 2 ⊢ (𝐴 = 𝐵 → ran 𝐴 = ran 𝐵) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → ran 𝐴 = ran 𝐵) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 ran crn 4777 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-sn 3715 df-pr 3716 df-op 3718 df-br 4132 df-opab 4194 df-cnv 4784 df-dm 4786 df-rn 4787 |
| This theorem is used by: resima2 5099 imaeq1 5124 imaeq2 5125 mptimass 5142 resiima 5148 elxp4 5278 elxp5 5279 funimacnv 5460 funimaexg 5468 fnima 5505 fnrnfv 5752 2ndvalg 6381 fo2nd 6396 f2ndres 6398 en1 7092 xpassen 7134 xpdom2 7135 sbthlemi4 7284 djudom 7439 exmidfodomrlemim 7559 seqeq1 10907 seqeq2 10908 seqeq3 10909 seq3val 10917 seqvalcd 10918 hashf1lem1 11306 s1rn 11407 ennnfonelemex 13362 ennnfonelemf1 13366 restval 13657 restid2 13660 imasival 13685 conjsubg 14138 prdsex 14278 prdsval 14279 rnrhmsubrg 14668 tgrest 15412 txvalex 15497 txval 15498 mopnval 15685 edgvalg 16522 edgopval 16525 edgstruct 16527 uhgr2edg 16669 usgr1e 16704 1loopgredg 16767 |
| Copyright terms: Public domain | W3C validator |