![]() |
Mathbox for BJ |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > Mathboxes > bd0r | Unicode version |
Description: A formula equivalent to a
bounded one is bounded. Stated with a
commuted (compared with bd0 13193) biconditional in the hypothesis, to work
better with definitions (![]() |
Ref | Expression |
---|---|
bd0r.min |
![]() ![]() |
bd0r.maj |
![]() ![]() ![]() ![]() ![]() ![]() |
Ref | Expression |
---|---|
bd0r |
![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bd0r.min |
. 2
![]() ![]() | |
2 | bd0r.maj |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() | |
3 | 2 | bicomi 131 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() |
4 | 1, 3 | bd0 13193 |
1
![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-bd0 13182 |
This theorem depends on definitions: df-bi 116 |
This theorem is referenced by: bdbi 13195 bdstab 13196 bddc 13197 bd3or 13198 bd3an 13199 bdfal 13202 bdxor 13205 bj-bdcel 13206 bdab 13207 bdcdeq 13208 bdne 13222 bdnel 13223 bdreu 13224 bdrmo 13225 bdsbcALT 13228 bdss 13233 bdeq0 13236 bdvsn 13243 bdop 13244 bdeqsuc 13250 bj-bdind 13299 |
Copyright terms: Public domain | W3C validator |