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

Theorem sup00 7131
Description: The supremum under an empty base set is always the empty set. (Contributed by AV, 4-Sep-2020.)
Assertion
Ref Expression
sup00  |-  sup ( B ,  (/) ,  R
)  =  (/)

Proof of Theorem sup00
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-sup 7112 . 2  |-  sup ( B ,  (/) ,  R
)  =  U. {
x  e.  (/)  |  ( A. y  e.  B  -.  x R y  /\  A. y  e.  (/)  ( y R x  ->  E. z  e.  B  y R
z ) ) }
2 rab0 3497 . . 3  |-  { x  e.  (/)  |  ( A. y  e.  B  -.  x R y  /\  A. y  e.  (/)  ( y R x  ->  E. z  e.  B  y R
z ) ) }  =  (/)
32unieqi 3874 . 2  |-  U. {
x  e.  (/)  |  ( A. y  e.  B  -.  x R y  /\  A. y  e.  (/)  ( y R x  ->  E. z  e.  B  y R
z ) ) }  =  U. (/)
4 uni0 3891 . 2  |-  U. (/)  =  (/)
51, 3, 43eqtri 2232 1  |-  sup ( B ,  (/) ,  R
)  =  (/)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1373   A.wral 2486   E.wrex 2487   {crab 2490   (/)c0 3468   U.cuni 3864   class class class wbr 4059   supcsup 7110
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-rab 2495  df-v 2778  df-dif 3176  df-in 3180  df-ss 3187  df-nul 3469  df-sn 3649  df-uni 3865  df-sup 7112
This theorem is referenced by:  inf00  7159
  Copyright terms: Public domain W3C validator