Theorem bd0r 16370

Description: A formula equivalent to a bounded one is bounded. Stated with a commuted (compared with bd0 16369) biconditional in the hypothesis, to work better with definitions (𝜓 is the definiendum that one wants to prove bounded). (Contributed by BJ, 3-Oct-2019.)

Hypotheses

Ref	Expression
bd0r.min	⊢ BOUNDED 𝜑
bd0r.maj	⊢ (𝜓 ↔ 𝜑)

Assertion

Ref	Expression
bd0r	⊢ BOUNDED 𝜓

Proof of Theorem bd0r

Step	Hyp	Ref	Expression
1		bd0r.min	. 2 ⊢ BOUNDED 𝜑
2		bd0r.maj	. . 3 ⊢ (𝜓 ↔ 𝜑)
3	2	bicomi 132	. 2 ⊢ (𝜑 ↔ 𝜓)
4	1, 3	bd0 16369	1 ⊢ BOUNDED 𝜓

Syntax hints:   ↔ wb 105  BOUNDED wbd 16357

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 16358

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  bdbi  16371  bdstab  16372  bddc  16373  bd3or  16374  bd3an  16375  bdfal  16378  bdxor  16381  bj-bdcel  16382  bdab  16383  bdcdeq  16384  bdne  16398  bdnel  16399  bdreu  16400  bdrmo  16401  bdsbcALT  16404  bdss  16409  bdeq0  16412  bdvsn  16419  bdop  16420  bdeqsuc  16426  bj-bdind  16475