| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > infeq1 | Unicode version | ||
| Description: Equality theorem for infimum. (Contributed by AV, 2-Sep-2020.) |
| Ref | Expression |
|---|---|
| infeq1 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | supeq1 7268 |
. 2
| |
| 2 | df-inf 7267 |
. 2
| |
| 3 | df-inf 7267 |
. 2
| |
| 4 | 1, 2, 3 | 3eqtr4g 2290 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| 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 2214 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-rab 2529 df-uni 3908 df-sup 7266 df-inf 7267 |
| This theorem is referenced by: infeq1d 7294 infeq1i 7295 |
| Copyright terms: Public domain | W3C validator |