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

Theorem bd0r 16524
Description: A formula equivalent to a bounded one is bounded. Stated with a commuted (compared with bd0 16523) biconditional in the hypothesis, to work better with definitions (
ps is the definiendum that one wants to prove bounded). (Contributed by BJ, 3-Oct-2019.)
Hypotheses
Ref Expression
bd0r.min  |- BOUNDED  ph
bd0r.maj  |-  ( ps  <->  ph )
Assertion
Ref Expression
bd0r  |- BOUNDED  ps

Proof of Theorem bd0r
StepHypRef Expression
1 bd0r.min . 2  |- BOUNDED  ph
2 bd0r.maj . . 3  |-  ( ps  <->  ph )
32bicomi 132 . 2  |-  ( ph  <->  ps )
41, 3bd0 16523 1  |- BOUNDED  ps
Colors of variables: wff set class
Syntax hints:    <-> wb 105  BOUNDED wbd 16511
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-bd0 16512
This theorem depends on definitions:  df-bi 117
This theorem is referenced by:  bdbi  16525  bdstab  16526  bddc  16527  bd3or  16528  bd3an  16529  bdfal  16532  bdxor  16535  bj-bdcel  16536  bdab  16537  bdcdeq  16538  bdne  16552  bdnel  16553  bdreu  16554  bdrmo  16555  bdsbcALT  16558  bdss  16563  bdeq0  16566  bdvsn  16573  bdop  16574  bdeqsuc  16580  bj-bdind  16629
  Copyright terms: Public domain W3C validator