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

Theorem nfinf 9393
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 9353 . 2 inf(𝐴, 𝐵, 𝑅) = sup(𝐴, 𝐵, 𝑅)
2 nfinf.1 . . 3 𝑥𝐴
3 nfinf.2 . . 3 𝑥𝐵
4 nfinf.3 . . . 4 𝑥𝑅
54nfcnv 5827 . . 3 𝑥𝑅
62, 3, 5nfsup 9361 . 2 𝑥sup(𝐴, 𝐵, 𝑅)
71, 6nfcxfr 2900 1 𝑥inf(𝐴, 𝐵, 𝑅)
Colors of variables: wff setvar class
Syntax hints:  wnfc 2887  ccnv 5624  supcsup 9350  infcinf 9351
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-xp 5631  df-cnv 5633  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-sup 9352  df-inf 9353
This theorem is referenced by:  iundisj  25540  iundisjf  32685  iundisjfi  32895  nfwsuc  36051  nfwlim  36055  allbutfiinf  45870  infrpgernmpt  45915  liminflelimsuplem  46225  stoweidlem62  46512  fourierdlem31  46588  iunhoiioolem  47125  smfinf  47268  prmdvdsfmtnof1lem1  48069
  Copyright terms: Public domain W3C validator