Theorem alsconv 15724

Description: There is an equivalence between the two "all some" forms. (Contributed by David A. Wheeler, 22-Oct-2018.)

Assertion

Ref	Expression
alsconv	⊢ (∀!𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀!𝑥 ∈ 𝐴𝜑)

Proof of Theorem alsconv

Step	Hyp	Ref	Expression
1		df-ral 2480	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
2	1	anbi1i 458	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 𝑥 ∈ 𝐴) ↔ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ∧ ∃𝑥 𝑥 ∈ 𝐴))
3		df-alsc 15723	. 2 ⊢ (∀!𝑥 ∈ 𝐴𝜑 ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 𝑥 ∈ 𝐴))
4		df-alsi 15722	. 2 ⊢ (∀!𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ∧ ∃𝑥 𝑥 ∈ 𝐴))
5	2, 3, 4	3bitr4ri 213	1 ⊢ (∀!𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀!𝑥 ∈ 𝐴𝜑)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1362  ∃wex 1506   ∈ wcel 2167  ∀wral 2475  ∀!walsi 15720  ∀!walsc 15721

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This theorem depends on definitions:  df-bi 117  df-ral 2480  df-alsi 15722  df-alsc 15723

This theorem is referenced by: (None)