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

Theorem bdcsn 10661
Description: The singleton of a setvar is bounded. (Contributed by BJ, 16-Oct-2019.)
Assertion
Ref Expression
bdcsn  |- BOUNDED  { x }

Proof of Theorem bdcsn
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 ax-bdeq 10611 . . 3  |- BOUNDED  y  =  x
21bdcab 10640 . 2  |- BOUNDED  { y  |  y  =  x }
3 df-sn 3404 . 2  |-  { x }  =  { y  |  y  =  x }
42, 3bdceqir 10635 1  |- BOUNDED  { x }
Colors of variables: wff set class
Syntax hints:   {cab 2067   {csn 3398  BOUNDED wbdc 10631
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1376  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-4 1440  ax-17 1459  ax-ial 1467  ax-ext 2063  ax-bd0 10604  ax-bdeq 10611  ax-bdsb 10613
This theorem depends on definitions:  df-bi 115  df-clab 2068  df-cleq 2074  df-clel 2077  df-sn 3404  df-bdc 10632
This theorem is referenced by:  bdcpr  10662  bdctp  10663  bdvsn  10665  bdcsuc  10671
  Copyright terms: Public domain W3C validator