Metamath Proof Explorer


Theorem rmo4

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

Ref Expression
Hypothesis rmo4.1 ( 𝑥 = 𝑦 → ( 𝜑𝜓 ) )
Assertion rmo4 ( ∃* 𝑥𝐴 𝜑 ↔ ∀ 𝑥𝐴𝑦𝐴 ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) )

Proof

Step Hyp Ref Expression
1 rmo4.1 ( 𝑥 = 𝑦 → ( 𝜑𝜓 ) )
2 df-rmo ( ∃* 𝑥𝐴 𝜑 ↔ ∃* 𝑥 ( 𝑥𝐴𝜑 ) )
3 an4 ( ( ( 𝑥𝐴𝜑 ) ∧ ( 𝑦𝐴𝜓 ) ) ↔ ( ( 𝑥𝐴𝑦𝐴 ) ∧ ( 𝜑𝜓 ) ) )
4 ancom ( ( 𝑥𝐴𝑦𝐴 ) ↔ ( 𝑦𝐴𝑥𝐴 ) )
5 4 anbi1i ( ( ( 𝑥𝐴𝑦𝐴 ) ∧ ( 𝜑𝜓 ) ) ↔ ( ( 𝑦𝐴𝑥𝐴 ) ∧ ( 𝜑𝜓 ) ) )
6 3 5 bitri ( ( ( 𝑥𝐴𝜑 ) ∧ ( 𝑦𝐴𝜓 ) ) ↔ ( ( 𝑦𝐴𝑥𝐴 ) ∧ ( 𝜑𝜓 ) ) )
7 6 imbi1i ( ( ( ( 𝑥𝐴𝜑 ) ∧ ( 𝑦𝐴𝜓 ) ) → 𝑥 = 𝑦 ) ↔ ( ( ( 𝑦𝐴𝑥𝐴 ) ∧ ( 𝜑𝜓 ) ) → 𝑥 = 𝑦 ) )
8 impexp ( ( ( ( 𝑦𝐴𝑥𝐴 ) ∧ ( 𝜑𝜓 ) ) → 𝑥 = 𝑦 ) ↔ ( ( 𝑦𝐴𝑥𝐴 ) → ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) )
9 impexp ( ( ( 𝑦𝐴𝑥𝐴 ) → ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) ↔ ( 𝑦𝐴 → ( 𝑥𝐴 → ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) ) )
10 7 8 9 3bitri ( ( ( ( 𝑥𝐴𝜑 ) ∧ ( 𝑦𝐴𝜓 ) ) → 𝑥 = 𝑦 ) ↔ ( 𝑦𝐴 → ( 𝑥𝐴 → ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) ) )
11 10 albii ( ∀ 𝑦 ( ( ( 𝑥𝐴𝜑 ) ∧ ( 𝑦𝐴𝜓 ) ) → 𝑥 = 𝑦 ) ↔ ∀ 𝑦 ( 𝑦𝐴 → ( 𝑥𝐴 → ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) ) )
12 df-ral ( ∀ 𝑦𝐴 ( 𝑥𝐴 → ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) ↔ ∀ 𝑦 ( 𝑦𝐴 → ( 𝑥𝐴 → ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) ) )
13 r19.21v ( ∀ 𝑦𝐴 ( 𝑥𝐴 → ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) ↔ ( 𝑥𝐴 → ∀ 𝑦𝐴 ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) )
14 11 12 13 3bitr2i ( ∀ 𝑦 ( ( ( 𝑥𝐴𝜑 ) ∧ ( 𝑦𝐴𝜓 ) ) → 𝑥 = 𝑦 ) ↔ ( 𝑥𝐴 → ∀ 𝑦𝐴 ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) )
15 14 albii ( ∀ 𝑥𝑦 ( ( ( 𝑥𝐴𝜑 ) ∧ ( 𝑦𝐴𝜓 ) ) → 𝑥 = 𝑦 ) ↔ ∀ 𝑥 ( 𝑥𝐴 → ∀ 𝑦𝐴 ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) )
16 eleq1w ( 𝑥 = 𝑦 → ( 𝑥𝐴𝑦𝐴 ) )
17 16 1 anbi12d ( 𝑥 = 𝑦 → ( ( 𝑥𝐴𝜑 ) ↔ ( 𝑦𝐴𝜓 ) ) )
18 17 mo4 ( ∃* 𝑥 ( 𝑥𝐴𝜑 ) ↔ ∀ 𝑥𝑦 ( ( ( 𝑥𝐴𝜑 ) ∧ ( 𝑦𝐴𝜓 ) ) → 𝑥 = 𝑦 ) )
19 df-ral ( ∀ 𝑥𝐴𝑦𝐴 ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ↔ ∀ 𝑥 ( 𝑥𝐴 → ∀ 𝑦𝐴 ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) ) )
20 15 18 19 3bitr4i ( ∃* 𝑥 ( 𝑥𝐴𝜑 ) ↔ ∀ 𝑥𝐴𝑦𝐴 ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) )
21 2 20 bitri ( ∃* 𝑥𝐴 𝜑 ↔ ∀ 𝑥𝐴𝑦𝐴 ( ( 𝜑𝜓 ) → 𝑥 = 𝑦 ) )