Theorem rmo2 3870

Description: Alternate definition of restricted "at most one." Note that ∃*𝑥 ∈ 𝐴𝜑 is not equivalent to ∃𝑦 ∈ 𝐴∀𝑥 ∈ 𝐴(𝜑 → 𝑥 = 𝑦) (in analogy to reu6 3717); to see this, let 𝐴 be the empty set. However, one direction of this pattern holds; see rmo2i 3871. (Contributed by NM, 17-Jun-2017.)

Hypothesis

Ref	Expression
rmo2.1	⊢ Ⅎ𝑦𝜑

Assertion

Ref	Expression
rmo2	⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦))

Distinct variable group:   𝑥,𝑦,𝐴

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem rmo2

Step	Hyp	Ref	Expression
1		df-rmo 3146	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2		nfv 1915	. . . 4 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐴
3		rmo2.1	. . . 4 ⊢ Ⅎ𝑦𝜑
4	2, 3	nfan 1900	. . 3 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)
5	4	mof 2647	. 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∃𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦))
6		impexp 453	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → (𝜑 → 𝑥 = 𝑦)))
7	6	albii 1820	. . . 4 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝜑 → 𝑥 = 𝑦)))
8		df-ral 3143	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝜑 → 𝑥 = 𝑦)))
9	7, 8	bitr4i 280	. . 3 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦))
10	9	exbii 1848	. 2 ⊢ (∃𝑦∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → 𝑥 = 𝑦) ↔ ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦))
11	1, 5, 10	3bitri 299	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398  ∀wal 1535  ∃wex 1780  Ⅎwnf 1784   ∈ wcel 2114  ∃*wmo 2620  ∀wral 3138  ∃*wrmo 3141

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-10 2145  ax-11 2161  ax-12 2177

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-mo 2622  df-ral 3143  df-rmo 3146

This theorem is referenced by:  rmo2i  3871  rmoanimALT  3879  disjiun  5053  poimirlem2  34909