Theorem mopick 1472

Description: "At most one" picks a variable value, eliminating an existential quantifier.

Assertion

Ref	Expression
mopick	|- ((E*xph /\ E.x(ph /\ ps)) -> (ph -> ps))

Proof of Theorem mopick

Step	Hyp	Ref	Expression
1		ax-17 1007	. . . 4 |- ((ph /\ ps) -> A.y(ph /\ ps))
2		hbs1 1371	. . . . 5 |- ([y / x]ph -> A.x[y / x]ph)
3		hbs1 1371	. . . . 5 |- ([y / x]ps -> A.x[y / x]ps)
4	2, 3	hban 1045	. . . 4 |- (([y / x]ph /\ [y / x]ps) -> A.x([y / x]ph /\ [y / x]ps))
5		sbequ12 1218	. . . . 5 |- (x = y -> (ph <-> [y / x]ph))
6		sbequ12 1218	. . . . 5 |- (x = y -> (ps <-> [y / x]ps))
7	5, 6	anbi12d 631	. . . 4 |- (x = y -> ((ph /\ ps) <-> ([y / x]ph /\ [y / x]ps)))
8	1, 4, 7	cbvex 1203	. . 3 |- (E.x(ph /\ ps) <-> E.y([y / x]ph /\ [y / x]ps))
9		sbequ2 1216	. . . . . . . . 9 |- (x = y -> ([y / x]ps -> ps))
10	9	imim2i 17	. . . . . . . 8 |- (((ph /\ [y / x]ph) -> x = y) -> ((ph /\ [y / x]ph) -> ([y / x]ps -> ps)))
11	10	exp3a 374	. . . . . . 7 |- (((ph /\ [y / x]ph) -> x = y) -> (ph -> ([y / x]ph -> ([y / x]ps -> ps))))
12	11	com4t 40	. . . . . 6 |- ([y / x]ph -> ([y / x]ps -> (((ph /\ [y / x]ph) -> x = y) -> (ph -> ps))))
13	12	imp 348	. . . . 5 |- (([y / x]ph /\ [y / x]ps) -> (((ph /\ [y / x]ph) -> x = y) -> (ph -> ps)))
14		ax-17 1007	. . . . . . 7 |- (ph -> A.yph)
15	14	mo3 1440	. . . . . 6 |- (E*xph <-> A.xA.y((ph /\ [y / x]ph) -> x = y))
16		ax-4 1009	. . . . . . 7 |- (A.y((ph /\ [y / x]ph) -> x = y) -> ((ph /\ [y / x]ph) -> x = y))
17	16	a4s 1020	. . . . . 6 |- (A.xA.y((ph /\ [y / x]ph) -> x = y) -> ((ph /\ [y / x]ph) -> x = y))
18	15, 17	sylbi 197	. . . . 5 |- (E*xph -> ((ph /\ [y / x]ph) -> x = y))
19	13, 18	syl5 21	. . . 4 |- (([y / x]ph /\ [y / x]ps) -> (E*xph -> (ph -> ps)))
20	19	19.23aiv 1333	. . 3 |- (E.y([y / x]ph /\ [y / x]ps) -> (E*xph -> (ph -> ps)))
21	8, 20	sylbi 197	. 2 |- (E.x(ph /\ ps) -> (E*xph -> (ph -> ps)))
22	21	impcom 349	1 |- ((E*xph /\ E.x(ph /\ ps)) -> (ph -> ps))

Syntax hints:   -> wi 3   /\ wa 221  A.wal 990  E.wex 1016  E*wmo 1420

This theorem is referenced by:  eupick 1473  mopick2 1476  moexex 1478  imadif 3679

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 998  ax-gen 999  ax-8 1000  ax-10 1002  ax-11 1003  ax-12 1004  ax-17 1007  ax-4 1009  ax-5o 1011  ax-6o 1014  ax-9o 1159  ax-10o 1177  ax-16 1247  ax-11o 1255

This theorem depends on definitions:  df-bi 145  df-or 222  df-an 223  df-ex 1017  df-sb 1209  df-eu 1421  df-mo 1422

Copyright terms: Public domain