Theorem rmo4f 3751

Description: Restricted "at most one" using implicit substitution. (Contributed by NM, 24-Oct-2006.) (Revised by Thierry Arnoux, 11-Oct-2016.) (Revised by Thierry Arnoux, 8-Mar-2017.) (Revised by Thierry Arnoux, 8-Oct-2017.)

Hypotheses

Ref	Expression
rmo4f.1	⊢ Ⅎ𝑥𝐴
rmo4f.2	⊢ Ⅎ𝑦𝐴
rmo4f.3	⊢ Ⅎ𝑥𝜓
rmo4f.4	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

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

Distinct variable groups:   𝑥,𝑦   𝜑,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥,𝑦)   𝐴(𝑥,𝑦)

Proof of Theorem rmo4f

Step	Hyp	Ref	Expression
1		rmo4f.1	. . 3 ⊢ Ⅎ𝑥𝐴
2		rmo4f.2	. . 3 ⊢ Ⅎ𝑦𝐴
3		nfv 1913	. . 3 ⊢ Ⅎ𝑦𝜑
4	1, 2, 3	rmo3f 3750	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
5		rmo4f.3	. . . . . 6 ⊢ Ⅎ𝑥𝜓
6		rmo4f.4	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
7	5, 6	sbiev 2312	. . . . 5 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
8	7	anbi2i 622	. . . 4 ⊢ ((𝜑 ∧ [𝑦 / 𝑥]𝜑) ↔ (𝜑 ∧ 𝜓))
9	8	imbi1i 349	. . 3 ⊢ (((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))
10	9	2ralbii 3130	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))
11	4, 10	bitri 275	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  Ⅎwnf 1781  [wsb 2064  Ⅎwnfc 2888  ∀wral 3063  ∃*wrmo 3382

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2105  ax-10 2136  ax-11 2153  ax-12 2173

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2537  df-clel 2813  df-nfc 2890  df-ral 3064  df-rmo 3383

This theorem is referenced by:  2sqreulem4  27507  disjorf  32592  funcnv5mpt  32678