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

Theorem bdeq0 16583
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 16581 . . 3  |- BOUNDED  (/)
21bdss 16580 . 2  |- BOUNDED  x  C_  (/)
3 0ss 3535 . . 3  |-  (/)  C_  x
4 eqss 3243 . . 3  |-  ( x  =  (/)  <->  ( x  C_  (/) 
/\  (/)  C_  x )
)
53, 4mpbiran2 950 . 2  |-  ( x  =  (/)  <->  x  C_  (/) )
62, 5bd0r 16541 1  |- BOUNDED  x  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1398    C_ wss 3201   (/)c0 3496  BOUNDED wbd 16528
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213  ax-bd0 16529  ax-bdim 16530  ax-bdn 16533  ax-bdal 16534  ax-bdeq 16536
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-v 2805  df-dif 3203  df-in 3207  df-ss 3214  df-nul 3497  df-bdc 16557
This theorem is referenced by:  bj-bd0el  16584  bj-nn0suc0  16666
  Copyright terms: Public domain W3C validator