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

Theorem zfreg 7552
Description: The Axiom of Regularity using abbreviations. Axiom 6 of [TakeutiZaring] p. 21. This is called the "weak form." There is also a "strong form," not requiring that  A be a set, that can be proved with more difficulty (see zfregs 7657). (Contributed by NM, 26-Nov-1995.)
Hypothesis
Ref Expression
zfreg.1  |-  A  e. 
_V
Assertion
Ref Expression
zfreg  |-  ( A  =/=  (/)  ->  E. x  e.  A  ( x  i^i  A )  =  (/) )
Distinct variable group:    x, A

Proof of Theorem zfreg
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 zfreg.1 . . 3  |-  A  e. 
_V
21zfregcl 7551 . 2  |-  ( E. x  x  e.  A  ->  E. x  e.  A  A. y  e.  x  -.  y  e.  A
)
3 n0 3629 . 2  |-  ( A  =/=  (/)  <->  E. x  x  e.  A )
4 disj 3660 . . 3  |-  ( ( x  i^i  A )  =  (/)  <->  A. y  e.  x  -.  y  e.  A
)
54rexbii 2722 . 2  |-  ( E. x  e.  A  ( x  i^i  A )  =  (/)  <->  E. x  e.  A  A. y  e.  x  -.  y  e.  A
)
62, 3, 53imtr4i 258 1  |-  ( A  =/=  (/)  ->  E. x  e.  A  ( x  i^i  A )  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4   E.wex 1550    = wceq 1652    e. wcel 1725    =/= wne 2598   A.wral 2697   E.wrex 2698   _Vcvv 2948    i^i cin 3311   (/)c0 3620
This theorem is referenced by:  inf3lem3  7574  en3lp  7661  setindtr  27032
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-reg 7549
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-v 2950  df-dif 3315  df-in 3319  df-nul 3621
  Copyright terms: Public domain W3C validator