Theorem mo2dc 2052

Description: Alternate definition of "at most one" where existence is decidable. (Contributed by Jim Kingdon, 2-Jul-2018.)

Hypothesis

Ref	Expression
mo2dc.1	|- F/ y ph

Assertion

Ref	Expression
mo2dc	|- (DECID E. x ph -> ( E* x ph <-> E. y A. x ( ph -> x = y ) ) )

Distinct variable group:   x, y

Allowed substitution hints:   ph( x, y)

Proof of Theorem mo2dc

Step	Hyp	Ref	Expression
1		mo2dc.1	. . 3 |- F/ y ph
2	1	modc 2040	. 2 |- (DECID E. x ph -> ( E. y A. x ( ph -> x = y ) <-> A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) ) )
3	1	nfri 1499	. . 3 |- ( ph -> A. y ph )
4	3	mo3h 2050	. 2 |- ( E* x ph <-> A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) )
5	2, 4	syl6rbbr 198	1 |- (DECID E. x ph -> ( E* x ph <-> E. y A. x ( ph -> x = y ) ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104  DECID wdc 819   A.wal 1329   F/wnf 1436   E.wex 1468   [wsb 1735   E*wmo 1998

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515

This theorem depends on definitions:  df-bi 116  df-dc 820  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001

This theorem is referenced by: (None)