Theorem mo2dc 2108

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	. . . 4 |- F/ y ph
2	1	nfri 1541	. . 3 |- ( ph -> A. y ph )
3	2	mo3h 2106	. 2 |- ( E* x ph <-> A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) )
4	1	modc 2096	. 2 |- (DECID E. x ph -> ( E. y A. x ( ph -> x = y ) <-> A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) ) )
5	3, 4	bitr4id 199	1 |- (DECID E. x ph -> ( E* x ph <-> E. y A. x ( ph -> x = y ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 835   A.wal 1370   F/wnf 1482   E.wex 1514   [wsb 1784   E*wmo 2054

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557

This theorem depends on definitions:  df-bi 117  df-dc 836  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057

This theorem is referenced by: (None)