Theorem bd0r 16765

Description: A formula equivalent to a bounded one is bounded. Stated with a commuted (compared with bd0 16764) 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

Step	Hyp	Ref	Expression
1		bd0r.min	. 2 |- BOUNDED ph
2		bd0r.maj	. . 3 |- ( ps <-> ph )
3	2	bicomi 132	. 2 |- ( ph <-> ps )
4	1, 3	bd0 16764	1 |- BOUNDED ps

Syntax hints:   <-> wb 105  BOUNDED wbd 16752

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 16753

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  bdbi  16766  bdstab  16767  bddc  16768  bd3or  16769  bd3an  16770  bdfal  16773  bdxor  16776  bj-bdcel  16777  bdab  16778  bdcdeq  16779  bdne  16793  bdnel  16794  bdreu  16795  bdrmo  16796  bdsbcALT  16799  bdss  16804  bdeq0  16807  bdvsn  16814  bdop  16815  bdeqsuc  16821  bj-bdind  16870