![]() |
Mathbox for BJ |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > Mathboxes > bdnth | Unicode version |
Description: A falsity is a bounded formula. (Contributed by BJ, 6-Oct-2019.) |
Ref | Expression |
---|---|
bdnth.1 |
![]() ![]() ![]() |
Ref | Expression |
---|---|
bdnth |
![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bdfal 14207 |
. 2
![]() ![]() | |
2 | fal 1360 |
. . 3
![]() ![]() ![]() | |
3 | bdnth.1 |
. . 3
![]() ![]() ![]() | |
4 | 2, 3 | 2false 701 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() |
5 | 1, 4 | bd0 14198 |
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 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-bd0 14187 ax-bdim 14188 ax-bdn 14191 ax-bdeq 14194 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-fal 1359 |
This theorem is referenced by: bdcnul 14239 |
Copyright terms: Public domain | W3C validator |