Theorem infex2g 7364

Description: Existence of infimum. (Contributed by Jim Kingdon, 1-Oct-2024.)

Assertion

Ref	Expression
infex2g	⊢ (𝐴 ∈ 𝐶 → inf(𝐵, 𝐴, 𝑅) ∈ V)

Proof of Theorem infex2g

Step	Hyp	Ref	Expression
1		df-inf 7315	. 2 ⊢ inf(𝐵, 𝐴, 𝑅) = sup(𝐵, 𝐴, ◡𝑅)
2		supex2g 7363	. 2 ⊢ (𝐴 ∈ 𝐶 → sup(𝐵, 𝐴, ◡𝑅) ∈ V)
3	1, 2	eqeltrid 2325	1 ⊢ (𝐴 ∈ 𝐶 → inf(𝐵, 𝐴, 𝑅) ∈ V)

Syntax hints:   → wi 4   ∈ wcel 2209  Vcvv 2821  ^◡ccnv 4768  supcsup 7312  infcinf 7313

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 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-14 2212  ax-ext 2220  ax-sep 4244  ax-un 4573

This theorem 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-rex 2534  df-rab 2537  df-v 2823  df-in 3226  df-ss 3233  df-uni 3931  df-sup 7314  df-inf 7315

This theorem is referenced by:  odzval  12998  ballotfilemi  13221