Theorem axpr 2768

Description: Unabbreviated version of the Axiom of Pairing of ZF set theory, derived as a theorem from the other axioms.

This theorem should not be referenced by any proof. Instead, use ax-pr 2769 below so that the uses of the Axiom of Pairing can be more easily identified.

Assertion

Ref	Expression
axpr	|- E.zA.w((w = x \/ w = y) -> w e. z)

Distinct variable groups:   x,z,w   y,z,w

Proof of Theorem axpr

Step	Hyp	Ref	Expression
1		zfpair 2767	. . 3 |- {x, y} e. V
2	1	isseti 1806	. 2 |- E.z z = {x, y}
3		dfcleq 1463	. . . 4 |- (z = {x, y} <-> A.w(w e. z <-> w e. {x, y}))
4		visset 1804	. . . . . . . 8 |- w e. V
5	4	elpr 2414	. . . . . . 7 |- (w e. {x, y} <-> (w = x \/ w = y))
6	5	bibi2i 606	. . . . . 6 |- ((w e. z <-> w e. {x, y}) <-> (w e. z <-> (w = x \/ w = y)))
7		bi2 149	. . . . . 6 |- ((w e. z <-> (w = x \/ w = y)) -> ((w = x \/ w = y) -> w e. z))
8	6, 7	sylbi 199	. . . . 5 |- ((w e. z <-> w e. {x, y}) -> ((w = x \/ w = y) -> w e. z))
9	8	19.20i 989	. . . 4 |- (A.w(w e. z <-> w e. {x, y}) -> A.w((w = x \/ w = y) -> w e. z))
10	3, 9	sylbi 199	. . 3 |- (z = {x, y} -> A.w((w = x \/ w = y) -> w e. z))
11	10	19.22i 1036	. 2 |- (E.z z = {x, y} -> E.zA.w((w = x \/ w = y) -> w e. z))
12	2, 11	ax-mp 7	1 |- E.zA.w((w = x \/ w = y) -> w e. z)

Syntax hints:   -> wi 3   <-> wb 146   \/ wo 222  A.wal 951   = wceq 953   e. wcel 955  E.wex 977  {cpr 2400

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-rep 2683  ax-sep 2693  ax-nul 2700  ax-pow 2732

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403

Copyright terms: Public domain