Theorem modc 2130

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 2128	. 2 |- ( E. y A. x ( ph -> x = y ) -> A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) )
3		exmiddc 848	. . 3 |- (DECID E. x ph -> ( E. x ph \/ -. E. x ph ) )
4	1	mor 2129	. . . 4 |- ( E. x ph -> ( A. x A. y ( ( ph /\ [ y / x ] ph ) -> x = y ) -> E. y A. x ( ph -> x = y ) ) )
5	1	mo2n 2114	. . . . 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 728	. . 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 720  DECID wdc 846   A.wal 1400   F/wnf 1513   E.wex 1545   [wsb 1815

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588

This theorem depends on definitions:  df-bi 117  df-dc 847  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816

This theorem is referenced by:  mo2dc  2142