Theorem mo2icl 3616

Description: Theorem for inferring "at most one." (Contributed by NM, 17-Oct-1996.)

Assertion

Ref	Expression
mo2icl	⊢ (∀𝑥(𝜑 → 𝑥 = 𝐴) → ∃*𝑥𝜑)

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem mo2icl

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq2 2748	. . . . . 6 ⊢ (𝑦 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑥 = 𝐴))
2	1	imbi2d 344	. . . . 5 ⊢ (𝑦 = 𝐴 → ((𝜑 → 𝑥 = 𝑦) ↔ (𝜑 → 𝑥 = 𝐴)))
3	2	albidv 1928	. . . 4 ⊢ (𝑦 = 𝐴 → (∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥(𝜑 → 𝑥 = 𝐴)))
4	3	imbi1d 345	. . 3 ⊢ (𝑦 = 𝐴 → ((∀𝑥(𝜑 → 𝑥 = 𝑦) → ∃*𝑥𝜑) ↔ (∀𝑥(𝜑 → 𝑥 = 𝐴) → ∃*𝑥𝜑)))
5		19.8a 2180	. . . 4 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
6		df-mo 2539	. . . 4 ⊢ (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))
7	5, 6	sylibr 237	. . 3 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝑦) → ∃*𝑥𝜑)
8	4, 7	vtoclg 3471	. 2 ⊢ (𝐴 ∈ V → (∀𝑥(𝜑 → 𝑥 = 𝐴) → ∃*𝑥𝜑))
9		eqvisset 3415	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐴 ∈ V)
10	9	imim2i 16	. . . . 5 ⊢ ((𝜑 → 𝑥 = 𝐴) → (𝜑 → 𝐴 ∈ V))
11	10	con3rr3 158	. . . 4 ⊢ (¬ 𝐴 ∈ V → ((𝜑 → 𝑥 = 𝐴) → ¬ 𝜑))
12	11	alimdv 1924	. . 3 ⊢ (¬ 𝐴 ∈ V → (∀𝑥(𝜑 → 𝑥 = 𝐴) → ∀𝑥 ¬ 𝜑))
13		alnex 1789	. . . 4 ⊢ (∀𝑥 ¬ 𝜑 ↔ ¬ ∃𝑥𝜑)
14		nexmo 2540	. . . 4 ⊢ (¬ ∃𝑥𝜑 → ∃*𝑥𝜑)
15	13, 14	sylbi 220	. . 3 ⊢ (∀𝑥 ¬ 𝜑 → ∃*𝑥𝜑)
16	12, 15	syl6 35	. 2 ⊢ (¬ 𝐴 ∈ V → (∀𝑥(𝜑 → 𝑥 = 𝐴) → ∃*𝑥𝜑))
17	8, 16	pm2.61i 185	1 ⊢ (∀𝑥(𝜑 → 𝑥 = 𝐴) → ∃*𝑥𝜑)

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1541   = wceq 1543  ∃wex 1787   ∈ wcel 2112  ∃*wmo 2537  Vcvv 3398

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-12 2177  ax-ext 2708

This theorem depends on definitions:  df-bi 210  df-an 400  df-tru 1546  df-ex 1788  df-sb 2073  df-mo 2539  df-clab 2715  df-cleq 2728  df-clel 2809  df-v 3400

This theorem is referenced by:  invdisj  5023  reusv1  5275  reusv2lem1  5276  opabiotafun  6770  fseqenlem2  9604  dfac2b  9709  imasaddfnlem  16987  imasvscafn  16996  bnj149  32522