MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  zfreg2 Structured version   Unicode version

Theorem zfreg2 8018
Description: The Axiom of Regularity using abbreviations. This form with the intersection arguments commuted (compared to zfreg 8017) is formally more convenient for us in some cases. Axiom Reg of [BellMachover] p. 480. (Contributed by NM, 17-Sep-2003.)
Hypothesis
Ref Expression
zfreg2.1  |-  A  e. 
_V
Assertion
Ref Expression
zfreg2  |-  ( A  =/=  (/)  ->  E. x  e.  A  ( A  i^i  x )  =  (/) )
Distinct variable group:    x, A

Proof of Theorem zfreg2
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 zfreg2.1 . . 3  |-  A  e. 
_V
21zfregcl 8016 . 2  |-  ( E. x  x  e.  A  ->  E. x  e.  A  A. y  e.  x  -.  y  e.  A
)
3 n0 3794 . 2  |-  ( A  =/=  (/)  <->  E. x  x  e.  A )
4 disjr 3868 . . 3  |-  ( ( A  i^i  x )  =  (/)  <->  A. y  e.  x  -.  y  e.  A
)
54rexbii 2965 . 2  |-  ( E. x  e.  A  ( A  i^i  x )  =  (/)  <->  E. x  e.  A  A. y  e.  x  -.  y  e.  A
)
62, 3, 53imtr4i 266 1  |-  ( A  =/=  (/)  ->  E. x  e.  A  ( A  i^i  x )  =  (/) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1379   E.wex 1596    e. wcel 1767    =/= wne 2662   A.wral 2814   E.wrex 2815   _Vcvv 3113    i^i cin 3475   (/)c0 3785
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-reg 8014
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-v 3115  df-dif 3479  df-in 3483  df-nul 3786
This theorem is referenced by:  zfregfr  8025
  Copyright terms: Public domain W3C validator