Theorem rmo4 2785

Description: Restricted "at most one" using implicit substitution. (Contributed by NM, 24-Oct-2006.) (Revised by NM, 16-Jun-2017.)

Hypothesis

Ref	Expression
rmo4.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

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

Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑦   𝜓,𝑥

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

Proof of Theorem rmo4

Step	Hyp	Ref	Expression
1		df-rmo 2356	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2		an4 550	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)))
3		ancom 262	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ↔ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴))
4	3	anbi1i 445	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)))
5	2, 4	bitri 182	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)))
6	5	imbi1i 236	. . . . . . 7 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝑦))
7		impexp 259	. . . . . . 7 ⊢ ((((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
8		impexp 259	. . . . . . 7 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)) ↔ (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))))
9	6, 7, 8	3bitri 204	. . . . . 6 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))))
10	9	albii 1399	. . . . 5 ⊢ (∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ ∀𝑦(𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))))
11		df-ral 2353	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)) ↔ ∀𝑦(𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))))
12		r19.21v 2438	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)) ↔ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
13	10, 11, 12	3bitr2i 206	. . . 4 ⊢ (∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
14	13	albii 1399	. . 3 ⊢ (∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
15		eleq1 2141	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
16		rmo4.1	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
17	15, 16	anbi12d 456	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓)))
18	17	mo4 2002	. . 3 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦))
19		df-ral 2353	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
20	14, 18, 19	3bitr4i 210	. 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))
21	1, 20	bitri 182	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))

Syntax hints:   → wi 4   ∧ wa 102   ↔ wb 103  ∀wal 1282   ∈ wcel 1433  ∃*wmo 1942  ∀wral 2348  ∃*wrmo 2351

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-cleq 2074  df-clel 2077  df-ral 2353  df-rmo 2356

This theorem is referenced by:  reu4  2786  supmoti  6406  lteupri  6807  elrealeu  6998  rereceu  7055  qbtwnz  9260  rsqrmo  9913  divalglemeunn  10321  divalglemeuneg  10323  bezoutlemeu  10396  pw2dvdseu  10546