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

Theorem bj-intexr 13095
Description: intexr 4070 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 13083 . . 3  |-  -.  _V  e.  _V
2 inteq 3769 . . . . 5  |-  ( A  =  (/)  ->  |^| A  =  |^| (/) )
3 int0 3780 . . . . 5  |-  |^| (/)  =  _V
42, 3syl6eq 2186 . . . 4  |-  ( A  =  (/)  ->  |^| A  =  _V )
54eleq1d 2206 . . 3  |-  ( A  =  (/)  ->  ( |^| A  e.  _V  <->  _V  e.  _V ) )
61, 5mtbiri 664 . 2  |-  ( A  =  (/)  ->  -.  |^| A  e.  _V )
76necon2ai 2360 1  |-  ( |^| A  e.  _V  ->  A  =/=  (/) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1331    e. wcel 1480    =/= wne 2306   _Vcvv 2681   (/)c0 3358   |^|cint 3766
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-bdn 13004  ax-bdel 13008  ax-bdsep 13071
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-v 2683  df-dif 3068  df-nul 3359  df-int 3767
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator