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

Theorem nfinf 8388
Description: Hypothesis builder for infimum. (Contributed by AV, 2-Sep-2020.)
Hypotheses
Ref Expression
nfinf.1  |-  F/_ x A
nfinf.2  |-  F/_ x B
nfinf.3  |-  F/_ x R
Assertion
Ref Expression
nfinf  |-  F/_ xinf ( A ,  B ,  R )

Proof of Theorem nfinf
StepHypRef Expression
1 df-inf 8349 . 2  |- inf ( A ,  B ,  R
)  =  sup ( A ,  B ,  `' R )
2 nfinf.1 . . 3  |-  F/_ x A
3 nfinf.2 . . 3  |-  F/_ x B
4 nfinf.3 . . . 4  |-  F/_ x R
54nfcnv 5301 . . 3  |-  F/_ x `' R
62, 3, 5nfsup 8357 . 2  |-  F/_ x sup ( A ,  B ,  `' R )
71, 6nfcxfr 2762 1  |-  F/_ xinf ( A ,  B ,  R )
Colors of variables: wff setvar class
Syntax hints:   F/_wnfc 2751   `'ccnv 5113   supcsup 8346  infcinf 8347
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-xp 5120  df-cnv 5122  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-sup 8348  df-inf 8349
This theorem is referenced by:  iundisj  23316  iundisjf  29402  iundisjfi  29555  nfwsuc  31764  nfwlim  31768  allbutfiinf  39647  infrpgernmpt  39695  liminflelimsuplem  40007  stoweidlem62  40279  fourierdlem31  40355  iunhoiioolem  40889  smfinf  41024  prmdvdsfmtnof1lem1  41496
  Copyright terms: Public domain W3C validator