| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > infeq1d | GIF version | ||
| Description: Equality deduction for infimum. (Contributed by AV, 2-Sep-2020.) |
| Ref | Expression |
|---|---|
| infeq1d.1 | ⊢ (𝜑 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| infeq1d | ⊢ (𝜑 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | infeq1d.1 | . 2 ⊢ (𝜑 → 𝐵 = 𝐶) | |
| 2 | infeq1 7357 | . 2 ⊢ (𝐵 = 𝐶 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → inf(𝐵, 𝐴, 𝑅) = inf(𝐶, 𝐴, 𝑅)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 infcinf 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 7330 df-inf 7331 |
| This theorem is used by: infssfzcldc 10686 infssfzledc 10687 zsupssdc 10690 xrbdtri 12067 nnmindc 12836 nnminle 12837 lcmval 12866 lcmass 12888 odzval 13049 ballotfilemi 13301 ballotfi 13340 nninfdclemcl 13397 nninfdclemp1 13399 nninfdc 13402 bdmetval 15726 bdxmet 15727 qtopbasss 15747 hovera 15873 hoverb 15874 hoverlt1 15875 hovergt0 15876 ivthdich 15879 repiecele0 17281 repiecege0 17282 repiecef 17283 |
| Copyright terms: Public domain | W3C validator |