| 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 7333 | . 2 ⊢ (𝐵 = 𝐶 → sup(𝐵, 𝐴, 𝑅) = sup(𝐶, 𝐴, 𝑅)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → sup(𝐵, 𝐴, 𝑅) = sup(𝐶, 𝐴, 𝑅)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 supcsup 7329 |
| 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-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 3936 df-sup 7331 |
| This theorem is used by: sup3exmid 9296 supminfex 10014 suprzubdc 10689 minmax 12021 xrminmax 12057 xrminrecl 12065 xrminadd 12067 gcdval 12762 gcdass 12818 pceulem 13103 pceu 13104 pcval 13105 pczpre 13106 pcdiv 13111 pcneg 13134 prdsex 14280 prdsval 14281 xmetxp 15745 xmetxpbl 15746 txmetcnp 15756 qtopbasss 15759 hovera 15885 hoverb 15886 hoverlt1 15887 hovergt0 15888 ivthdich 15891 repiecele0 17293 repiecege0 17294 repiecef 17295 |
| Copyright terms: Public domain | W3C validator |