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

Theorem nfsup 6405
Description: Hypothesis builder for supremum. (Contributed by Mario Carneiro, 20-Mar-2014.)
Hypotheses
Ref Expression
nfsup.1  |-  F/_ x A
nfsup.2  |-  F/_ x B
nfsup.3  |-  F/_ x R
Assertion
Ref Expression
nfsup  |-  F/_ x sup ( A ,  B ,  R )

Proof of Theorem nfsup
Dummy variables  u  v  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-sup 6397 . 2  |-  sup ( A ,  B ,  R )  =  U. { u  e.  B  |  ( A. v  e.  A  -.  u R v  /\  A. v  e.  B  (
v R u  ->  E. w  e.  A  v R w ) ) }
2 nfsup.1 . . . . . 6  |-  F/_ x A
3 nfcv 2219 . . . . . . . 8  |-  F/_ x u
4 nfsup.3 . . . . . . . 8  |-  F/_ x R
5 nfcv 2219 . . . . . . . 8  |-  F/_ x
v
63, 4, 5nfbr 3829 . . . . . . 7  |-  F/ x  u R v
76nfn 1588 . . . . . 6  |-  F/ x  -.  u R v
82, 7nfralya 2404 . . . . 5  |-  F/ x A. v  e.  A  -.  u R v
9 nfsup.2 . . . . . 6  |-  F/_ x B
105, 4, 3nfbr 3829 . . . . . . 7  |-  F/ x  v R u
11 nfcv 2219 . . . . . . . . 9  |-  F/_ x w
125, 4, 11nfbr 3829 . . . . . . . 8  |-  F/ x  v R w
132, 12nfrexya 2405 . . . . . . 7  |-  F/ x E. w  e.  A  v R w
1410, 13nfim 1504 . . . . . 6  |-  F/ x
( v R u  ->  E. w  e.  A  v R w )
159, 14nfralya 2404 . . . . 5  |-  F/ x A. v  e.  B  ( v R u  ->  E. w  e.  A  v R w )
168, 15nfan 1497 . . . 4  |-  F/ x
( A. v  e.  A  -.  u R v  /\  A. v  e.  B  ( v R u  ->  E. w  e.  A  v R w ) )
1716, 9nfrabxy 2534 . . 3  |-  F/_ x { u  e.  B  |  ( A. v  e.  A  -.  u R v  /\  A. v  e.  B  (
v R u  ->  E. w  e.  A  v R w ) ) }
1817nfuni 3607 . 2  |-  F/_ x U. { u  e.  B  |  ( A. v  e.  A  -.  u R v  /\  A. v  e.  B  (
v R u  ->  E. w  e.  A  v R w ) ) }
191, 18nfcxfr 2216 1  |-  F/_ x sup ( A ,  B ,  R )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102   F/_wnfc 2206   A.wral 2348   E.wrex 2349   {crab 2352   U.cuni 3601   class class class wbr 3785   supcsup 6395
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-rab 2357  df-v 2603  df-un 2977  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-sup 6397
This theorem is referenced by:  nfinf  6430  infssuzcldc  10347
  Copyright terms: Public domain W3C validator