Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-intexr Unicode version

Theorem bj-intexr 16607
Description: intexr 4245 from bounded separation. (Contributed by BJ, 18-Nov-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-intexr  |-  ( |^| A  e.  _V  ->  A  =/=  (/) )

Proof of Theorem bj-intexr
StepHypRef Expression
1 bj-vprc 16595 . . 3  |-  -.  _V  e.  _V
2 inteq 3936 . . . . 5  |-  ( A  =  (/)  ->  |^| A  =  |^| (/) )
3 int0 3947 . . . . 5  |-  |^| (/)  =  _V
42, 3eqtrdi 2280 . . . 4  |-  ( A  =  (/)  ->  |^| A  =  _V )
54eleq1d 2300 . . 3  |-  ( A  =  (/)  ->  ( |^| A  e.  _V  <->  _V  e.  _V ) )
61, 5mtbiri 682 . 2  |-  ( A  =  (/)  ->  -.  |^| A  e.  _V )
76necon2ai 2457 1  |-  ( |^| A  e.  _V  ->  A  =/=  (/) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2202    =/= wne 2403   _Vcvv 2803   (/)c0 3496   |^|cint 3933
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-bdn 16516  ax-bdel 16520  ax-bdsep 16583
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-v 2805  df-dif 3203  df-nul 3497  df-int 3934
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator