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

Theorem bj-snex 12070
 Description: snex 4026 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
bj-snex.1
Assertion
Ref Expression
bj-snex

Proof of Theorem bj-snex
StepHypRef Expression
1 bj-snex.1 . 2
2 bj-snexg 12069 . 2
31, 2ax-mp 7 1
 Colors of variables: wff set class Syntax hints:   wcel 1439  cvv 2620  csn 3450 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-14 1451  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071  ax-pr 4045  ax-bdor 11973  ax-bdeq 11977  ax-bdsep 12041 This theorem depends on definitions:  df-bi 116  df-tru 1293  df-nf 1396  df-sb 1694  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-v 2622  df-un 3004  df-sn 3456  df-pr 3457 This theorem is referenced by:  bj-d0clsepcl  12086
 Copyright terms: Public domain W3C validator