Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bdne GIF version

Theorem bdne 17045
Description: Inequality of two setvars is a bounded formula. (Contributed by BJ, 16-Oct-2019.)
Assertion
Ref Expression
bdne BOUNDED 𝑥 ≠ 𝑦

Proof of Theorem bdne
StepHypRef Expression
1 ax-bdeq 17012 . . 3 BOUNDED 𝑥 = 𝑦
21ax-bdn 17009 . 2 BOUNDED ¬ 𝑥 = 𝑦
3 df-ne 2421 . 2 (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦)
42, 3bd0r 17017 1 BOUNDED 𝑥 ≠ 𝑦
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3   ≠ wne 2420  BOUNDED wbd 17004
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-bd0 17005  ax-bdn 17009  ax-bdeq 17012
This proof depends on definitions:  df-bi 117  df-ne 2421
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator