ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nfinf Unicode version

Theorem nfinf 7076
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 7044 . 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 4841 . . 3  |-  F/_ x `' R
62, 3, 5nfsup 7051 . 2  |-  F/_ x sup ( A ,  B ,  `' R )
71, 6nfcxfr 2333 1  |-  F/_ xinf ( A ,  B ,  R )
Colors of variables: wff set class
Syntax hints:   F/_wnfc 2323   `'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-in1 615  ax-in2 616  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-ext 2175
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-un 3157  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-cnv 4667  df-sup 7043  df-inf 7044
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator