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

Theorem sup00 6898
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 6879 . 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 3396 . . 3  |-  { x  e.  (/)  |  ( A. y  e.  B  -.  x R y  /\  A. y  e.  (/)  ( y R x  ->  E. z  e.  B  y R
z ) ) }  =  (/)
32unieqi 3754 . 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 3771 . 2  |-  U. (/)  =  (/)
51, 3, 43eqtri 2165 1  |-  sup ( B ,  (/) ,  R
)  =  (/)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    = wceq 1332   A.wral 2417   E.wrex 2418   {crab 2421   (/)c0 3368   U.cuni 3744   class class class wbr 3937   supcsup 6877
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-dif 3078  df-in 3082  df-ss 3089  df-nul 3369  df-sn 3538  df-uni 3745  df-sup 6879
This theorem is referenced by:  inf00  6926
  Copyright terms: Public domain W3C validator