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

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

Proof of Theorem bj-intnexr
StepHypRef Expression
1 bj-vprc 14568 . 2  |-  -.  _V  e.  _V
2 eleq1 2240 . 2  |-  ( |^| A  =  _V  ->  (
|^| A  e.  _V  <->  _V  e.  _V ) )
31, 2mtbiri 675 1  |-  ( |^| A  =  _V  ->  -. 
|^| A  e.  _V )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1353    e. wcel 2148   _Vcvv 2737   |^|cint 3844
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 614  ax-in2 615  ax-5 1447  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-13 2150  ax-14 2151  ax-ext 2159  ax-bdn 14489  ax-bdel 14493  ax-bdsep 14556
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-v 2739
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator