| 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 7290 | . 2 ⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, 𝑅) = sup(𝐶, 𝐴, 𝑅)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) = sup(𝐶, 𝐴, 𝑅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 supcsup 7286 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2216 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-rex 2528 df-rab 2531 df-uni 3920 df-sup 7288 |
| This theorem is referenced by: sup3exmid 9248 supminfex 9947 suprzubdc 10620 minmax 11940 xrminmax 11975 xrminrecl 11983 xrminadd 11985 gcdval 12680 gcdass 12736 pceulem 13017 pceu 13018 pcval 13019 pczpre 13020 pcdiv 13025 pcneg 13048 prdsex 13566 prdsval 13570 xmetxp 15484 xmetxpbl 15485 txmetcnp 15495 qtopbasss 15498 hovera 15624 hoverb 15625 hoverlt1 15626 hovergt0 15627 ivthdich 15630 repiecele0 16922 repiecege0 16923 repiecef 16924 |
| Copyright terms: Public domain | W3C validator |