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

Theorem bj-axempty 15048
Description: Axiom of the empty set from bounded separation. It is provable from bounded separation since the intuitionistic FOL used in iset.mm assumes a nonempty universe. See axnul 4143. (Contributed by BJ, 25-Oct-2020.) (Proof modification is discouraged.) Use ax-nul 4144 instead. (New usage is discouraged.)
Assertion
Ref Expression
bj-axempty  |-  E. x A. y  e.  x F.
Distinct variable group:    x, y

Proof of Theorem bj-axempty
StepHypRef Expression
1 bj-axemptylem 15047 . 2  |-  E. x A. y ( y  e.  x  -> F.  )
2 df-ral 2473 . . 3  |-  ( A. y  e.  x F.  <->  A. y ( y  e.  x  -> F.  )
)
32exbii 1616 . 2  |-  ( E. x A. y  e.  x F.  <->  E. x A. y ( y  e.  x  -> F.  )
)
41, 3mpbir 146 1  |-  E. x A. y  e.  x F.
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1362   F. wfal 1369   E.wex 1503   A.wral 2468
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 615  ax-in2 616  ax-5 1458  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-4 1521  ax-ial 1545  ax-bd0 14968  ax-bdim 14969  ax-bdn 14972  ax-bdeq 14975  ax-bdsep 15039
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-fal 1370  df-ral 2473
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator