| Mathbox for BJ | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > bdne | GIF version | ||
| Description: Inequality of two setvars is a bounded formula. (Contributed by BJ, 16-Oct-2019.) | 
| Ref | Expression | 
|---|---|
| bdne | ⊢ BOUNDED 𝑥 ≠ 𝑦 | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | ax-bdeq 15466 | . . 3 ⊢ BOUNDED 𝑥 = 𝑦 | |
| 2 | 1 | ax-bdn 15463 | . 2 ⊢ BOUNDED ¬ 𝑥 = 𝑦 | 
| 3 | df-ne 2368 | . 2 ⊢ (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦) | |
| 4 | 2, 3 | bd0r 15471 | 1 ⊢ BOUNDED 𝑥 ≠ 𝑦 | 
| Colors of variables: wff set class | 
| Syntax hints: ¬ wn 3 ≠ wne 2367 BOUNDED wbd 15458 | 
| 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 15459 ax-bdn 15463 ax-bdeq 15466 | 
| This theorem depends on definitions: df-bi 117 df-ne 2368 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |