| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > supeq1d | GIF version | ||
| Description: Equality deduction for supremum. (Contributed by Paul Chapman, 22-Jun-2011.) |
| Ref | Expression |
|---|---|
| supeq1d.1 | ⊢ (𝜑 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| supeq1d | ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) = sup(𝐶, 𝐴, 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | supeq1d.1 | . 2 ⊢ (𝜑 → 𝐵 = 𝐶) | |
| 2 | supeq1 7320 | . 2 ⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, 𝑅) = sup(𝐶, 𝐴, 𝑅)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) = sup(𝐶, 𝐴, 𝑅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 supcsup 7316 |
| 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 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 theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-rab 2537 df-uni 3934 df-sup 7318 |
| This theorem is referenced by: sup3exmid 9281 supminfex 9980 suprzubdc 10654 minmax 11979 xrminmax 12014 xrminrecl 12022 xrminadd 12024 gcdval 12719 gcdass 12775 pceulem 13056 pceu 13057 pcval 13058 pczpre 13059 pcdiv 13064 pcneg 13087 prdsex 14155 prdsval 14156 xmetxp 15591 xmetxpbl 15592 txmetcnp 15602 qtopbasss 15605 hovera 15731 hoverb 15732 hoverlt1 15733 hovergt0 15734 ivthdich 15737 repiecele0 17049 repiecege0 17050 repiecef 17051 |
| Copyright terms: Public domain | W3C validator |