| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > bdne | Unicode version | ||
| Description: Inequality of two setvars is a bounded formula. (Contributed by BJ, 16-Oct-2019.) |
| Ref | Expression |
|---|---|
| bdne |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-bdeq 15550 |
. . 3
| |
| 2 | 1 | ax-bdn 15547 |
. 2
|
| 3 | df-ne 2368 |
. 2
| |
| 4 | 2, 3 | bd0r 15555 |
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-bd0 15543 ax-bdn 15547 ax-bdeq 15550 |
| This theorem depends on definitions: df-bi 117 df-ne 2368 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |