Theorem alsconv 13956

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 2449	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑))
2	1	anbi1i 454	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 𝑥 ∈ 𝐴) ↔ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ∧ ∃𝑥 𝑥 ∈ 𝐴))
3		df-alsc 13955	. 2 ⊢ (∀!𝑥 ∈ 𝐴𝜑 ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 𝑥 ∈ 𝐴))
4		df-alsi 13954	. 2 ⊢ (∀!𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ∧ ∃𝑥 𝑥 ∈ 𝐴))
5	2, 3, 4	3bitr4ri 212	1 ⊢ (∀!𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ ∀!𝑥 ∈ 𝐴𝜑)

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∀wal 1341  ∃wex 1480   ∈ wcel 2136  ∀wral 2444  ∀!walsi 13952  ∀!walsc 13953

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

This theorem depends on definitions:  df-bi 116  df-ral 2449  df-alsi 13954  df-alsc 13955

This theorem is referenced by: (None)