![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > infex2g | GIF version |
Description: Existence of infimum. (Contributed by Jim Kingdon, 1-Oct-2024.) |
Ref | Expression |
---|---|
infex2g | ⊢ (𝐴 ∈ 𝐶 → inf(𝐵, 𝐴, 𝑅) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-inf 7044 | . 2 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅) | |
2 | supex2g 7092 | . 2 ⊢ (𝐴 ∈ 𝐶 → sup(𝐵, 𝐴, ◡𝑅) ∈ V) | |
3 | 1, 2 | eqeltrid 2280 | 1 ⊢ (𝐴 ∈ 𝐶 → inf(𝐵, 𝐴, 𝑅) ∈ V) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∈ wcel 2164 Vcvv 2760 ◡ccnv 4658 supcsup 7041 infcinf 7042 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-un 4464 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-rex 2478 df-rab 2481 df-v 2762 df-in 3159 df-ss 3166 df-uni 3836 df-sup 7043 df-inf 7044 |
This theorem is referenced by: odzval 12379 |
Copyright terms: Public domain | W3C validator |