![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > infeq2 | GIF version |
Description: Equality theorem for infimum. (Contributed by AV, 2-Sep-2020.) |
Ref | Expression |
---|---|
infeq2 | ⊢ (𝐵 = 𝐶 → inf(𝐴, 𝐵, 𝑅) = inf(𝐴, 𝐶, 𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | supeq2 6985 | . 2 ⊢ (𝐵 = 𝐶 → sup(𝐴, 𝐵, ◡𝑅) = sup(𝐴, 𝐶, ◡𝑅)) | |
2 | df-inf 6981 | . 2 ⊢ inf(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, ◡𝑅) | |
3 | df-inf 6981 | . 2 ⊢ inf(𝐴, 𝐶, 𝑅) = sup(𝐴, 𝐶, ◡𝑅) | |
4 | 1, 2, 3 | 3eqtr4g 2235 | 1 ⊢ (𝐵 = 𝐶 → inf(𝐴, 𝐵, 𝑅) = inf(𝐴, 𝐶, 𝑅)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1353 ◡ccnv 4624 supcsup 6978 infcinf 6979 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-rab 2464 df-uni 3810 df-sup 6980 df-inf 6981 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |