Theorem rmo4 2924

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 2457	. 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2		an4 582	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)))
3		ancom 264	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ↔ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴))
4	3	anbi1i 456	. . . . . . . . 9 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)))
5	2, 4	bitri 183	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)))
6	5	imbi1i 237	. . . . . . 7 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝑦))
7		impexp 261	. . . . . . 7 ⊢ ((((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
8		impexp 261	. . . . . . 7 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)) ↔ (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))))
9	6, 7, 8	3bitri 205	. . . . . 6 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))))
10	9	albii 1464	. . . . 5 ⊢ (∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ ∀𝑦(𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))))
11		df-ral 2454	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)) ↔ ∀𝑦(𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))))
12		r19.21v 2548	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝐴 → ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)) ↔ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
13	10, 11, 12	3bitr2i 207	. . . 4 ⊢ (∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
14	13	albii 1464	. . 3 ⊢ (∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
15		eleq1 2234	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
16		rmo4.1	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
17	15, 16	anbi12d 471	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓)))
18	17	mo4 2081	. . 3 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ 𝜓)) → 𝑥 = 𝑦))
19		df-ral 2454	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦)))
20	14, 18, 19	3bitr4i 211	. 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))
21	1, 20	bitri 183	1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ 𝜓) → 𝑥 = 𝑦))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∀wal 1347  ∃*wmo 2021   ∈ wcel 2142  ∀wral 2449  ∃*wrmo 2452

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 705  ax-5 1441  ax-7 1442  ax-gen 1443  ax-ie1 1487  ax-ie2 1488  ax-8 1498  ax-10 1499  ax-11 1500  ax-i12 1501  ax-bndl 1503  ax-4 1504  ax-17 1520  ax-i9 1524  ax-ial 1528  ax-i5r 1529  ax-ext 2153

This theorem depends on definitions:  df-bi 116  df-nf 1455  df-sb 1757  df-eu 2023  df-mo 2024  df-cleq 2164  df-clel 2167  df-ral 2454  df-rmo 2457

This theorem is referenced by:  reu4  2925  disjnim  3981  supmoti  6974  lteupri  7583  elrealeu  7795  rereceu  7855  exbtwnz  10211  rsqrmo  10995  divalglemeunn  11884  divalglemeuneg  11886  bezoutlemeu  11966  pw2dvdseu  12126  mgmidmo  12630  mndinvmod  12682  dedekindeu  13480  dedekindicclemicc  13489