| 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 7327 | . 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 7323 |
| 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 7325 |
| This theorem is used by: sup3exmid 9290 supminfex 10007 suprzubdc 10682 minmax 12013 xrminmax 12049 xrminrecl 12057 xrminadd 12059 gcdval 12754 gcdass 12810 pceulem 13095 pceu 13096 pcval 13097 pczpre 13098 pcdiv 13103 pcneg 13126 prdsex 14223 prdsval 14224 xmetxp 15660 xmetxpbl 15661 txmetcnp 15671 qtopbasss 15674 hovera 15800 hoverb 15801 hoverlt1 15802 hovergt0 15803 ivthdich 15806 repiecele0 17197 repiecege0 17198 repiecef 17199 |
| Copyright terms: Public domain | W3C validator |