Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bdeq0 Unicode version

Theorem bdeq0 16807
Description: Boundedness of the formula expressing that a setvar is equal to the empty class. (Contributed by BJ, 21-Nov-2019.)
Assertion
Ref Expression
bdeq0  |- BOUNDED  x  =  (/)

Proof of Theorem bdeq0
StepHypRef Expression
1 bdcnul 16805 . . 3  |- BOUNDED  (/)
21bdss 16804 . 2  |- BOUNDED  x  C_  (/)
3 0ss 3561 . . 3  |-  (/)  C_  x
4 eqss 3263 . . 3  |-  ( x  =  (/)  <->  ( x  C_  (/) 
/\  (/)  C_  x )
)
53, 4mpbiran2 954 . 2  |-  ( x  =  (/)  <->  x  C_  (/) )
62, 5bd0r 16765 1  |- BOUNDED  x  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1402    C_ wss 3220   (/)c0 3520  BOUNDED wbd 16752
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220  ax-bd0 16753  ax-bdim 16754  ax-bdn 16757  ax-bdal 16758  ax-bdeq 16760
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-dif 3222  df-in 3226  df-ss 3233  df-nul 3521  df-bdc 16781
This theorem is referenced by:  bj-bd0el  16808  bj-nn0suc0  16890
  Copyright terms: Public domain W3C validator