| 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 16871 |
. 2
| |
| 2 | fal 1409 |
. . 3
| |
| 3 | bdnth.1 |
. . 3
| |
| 4 | 2, 3 | 2false 713 |
. 2
|
| 5 | 1, 4 | bd0 16862 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-bd0 16851 ax-bdim 16852 ax-bdn 16855 ax-bdeq 16858 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-fal 1408 |
| This theorem is used by: bdcnul 16903 |
| Copyright terms: Public domain | W3C validator |