MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfinf Structured version   Visualization version   GIF version

Theorem nfinf 9389
Description: Hypothesis builder for infimum. (Contributed by AV, 2-Sep-2020.)
Hypotheses
Ref Expression
nfinf.1 𝑥𝐴
nfinf.2 𝑥𝐵
nfinf.3 𝑥𝑅
Assertion
Ref Expression
nfinf 𝑥inf(𝐴, 𝐵, 𝑅)

Proof of Theorem nfinf
StepHypRef Expression
1 df-inf 9349 . 2 inf(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑅)
2 nfinf.1 . . 3 𝑥𝐴
3 nfinf.2 . . 3 𝑥𝐵
4 nfinf.3 . . . 4 𝑥𝑅
54nfcnv 5827 . . 3 𝑥𝑅
62, 3, 5nfsup 9357 . 2 𝑥sup(𝐴, 𝐵, 𝑅)
71, 6nfcxfr 2897 1 𝑥inf(𝐴, 𝐵, 𝑅)
Colors of variables: wff setvar class
Syntax hints:  wnfc 2884  ccnv 5623  supcsup 9346  infcinf 9347
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-pr 5370
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-xp 5630  df-cnv 5632  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-sup 9348  df-inf 9349
This theorem is referenced by:  iundisj  25525  iundisjf  32674  iundisjfi  32884  nfwsuc  36014  nfwlim  36018  allbutfiinf  45866  infrpgernmpt  45911  liminflelimsuplem  46221  stoweidlem62  46508  fourierdlem31  46584  iunhoiioolem  47121  smfinf  47264  prmdvdsfmtnof1lem1  48059
  Copyright terms: Public domain W3C validator