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

Theorem bdeq0 13236
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 13234 . . 3  |- BOUNDED  (/)
21bdss 13233 . 2  |- BOUNDED  x  C_  (/)
3 0ss 3406 . . 3  |-  (/)  C_  x
4 eqss 3117 . . 3  |-  ( x  =  (/)  <->  ( x  C_  (/) 
/\  (/)  C_  x )
)
53, 4mpbiran2 926 . 2  |-  ( x  =  (/)  <->  x  C_  (/) )
62, 5bd0r 13194 1  |- BOUNDED  x  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1332    C_ wss 3076   (/)c0 3368  BOUNDED wbd 13181
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  ax-bd0 13182  ax-bdim 13183  ax-bdn 13186  ax-bdal 13187  ax-bdeq 13189
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-v 2691  df-dif 3078  df-in 3082  df-ss 3089  df-nul 3369  df-bdc 13210
This theorem is referenced by:  bj-bd0el  13237  bj-nn0suc0  13319
  Copyright terms: Public domain W3C validator