Theorem modc 2121

Description: Equivalent definitions of "there exists at most one," given decidable existence. (Contributed by Jim Kingdon, 1-Jul-2018.)

Hypothesis

Ref	Expression
modc.1	|- F/ y ph

Assertion

Ref	Expression
modc	|- (DECID E. x ph -> ( E. y A. x ( ph -> x = y ) <-> A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) ) )

Distinct variable group:   x, y

Allowed substitution hints:   ph( x, y)

Proof of Theorem modc

Step	Hyp	Ref	Expression
1		modc.1	. . 3 |- F/ y ph
2	1	mo23 2119	. 2 |- ( E. y A. x ( ph -> x = y ) -> A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) )
3		exmiddc 841	. . 3 |- (DECID E. x ph -> ( E. x ph \/ -. E. x ph ) )
4	1	mor 2120	. . . 4 |- ( E. x ph -> ( A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) -> E. y A. x ( ph -> x = y ) ) )
5	1	mo2n 2105	. . . . 5 |- ( -. E. x ph -> E. y A. x ( ph -> x = y ) )
6	5	a1d 22	. . . 4 |- ( -. E. x ph -> ( A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) -> E. y A. x ( ph -> x = y ) ) )
7	4, 6	jaoi 721	. . 3 |- ( ( E. x ph \/ -. E. x ph ) -> ( A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) -> E. y A. x ( ph -> x = y ) ) )
8	3, 7	syl 14	. 2 |- (DECID E. x ph -> ( A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) -> E. y A. x ( ph -> x = y ) ) )
9	2, 8	impbid2 143	1 |- (DECID E. x ph -> ( E. y A. x ( ph -> x = y ) <-> A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 713  DECID wdc 839   A.wal 1393   F/wnf 1506   E.wex 1538   [wsb 1808

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-11 1552  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581

This theorem depends on definitions:  df-bi 117  df-dc 840  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809

This theorem is referenced by:  mo2dc  2133