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

Theorem bdctp 15626
Description: The unordered triple of three setvars is bounded. (Contributed by BJ, 16-Oct-2019.)
Assertion
Ref Expression
bdctp  |- BOUNDED  { x ,  y ,  z }

Proof of Theorem bdctp
StepHypRef Expression
1 bdcpr 15625 . . 3  |- BOUNDED  { x ,  y }
2 bdcsn 15624 . . 3  |- BOUNDED  { z }
31, 2bdcun 15616 . 2  |- BOUNDED  ( { x ,  y }  u.  {
z } )
4 df-tp 3631 . 2  |-  { x ,  y ,  z }  =  ( { x ,  y }  u.  { z } )
53, 4bdceqir 15598 1  |- BOUNDED  { x ,  y ,  z }
Colors of variables: wff set class
Syntax hints:    u. cun 3155   {csn 3623   {cpr 3624   {ctp 3625  BOUNDED wbdc 15594
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-5 1461  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-4 1524  ax-17 1540  ax-ial 1548  ax-ext 2178  ax-bd0 15567  ax-bdor 15570  ax-bdeq 15574  ax-bdsb 15576
This theorem depends on definitions:  df-bi 117  df-clab 2183  df-cleq 2189  df-clel 2192  df-un 3161  df-sn 3629  df-pr 3630  df-tp 3631  df-bdc 15595
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator