Theorem r19.28zf 45131

Description: Restricted quantifier version of Theorem 19.28 of [Margaris] p. 90. It is valid only when the domain of quantification is not empty. (Contributed by Glauco Siliprandi, 24-Jan-2025.)

Hypotheses

Ref	Expression
r19.28zf.1	⊢ Ⅎ𝑥𝜑
r19.28zf.2	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
r19.28zf	⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓)))

Proof of Theorem r19.28zf

Step	Hyp	Ref	Expression
1		r19.26 3111	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓))
2		r19.28zf.1	. . . 4 ⊢ Ⅎ𝑥𝜑
3		r19.28zf.2	. . . 4 ⊢ Ⅎ𝑥𝐴
4	2, 3	r19.3rzf 45130	. . 3 ⊢ (𝐴 ≠ ∅ → (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑))
5	4	anbi1d 631	. 2 ⊢ (𝐴 ≠ ∅ → ((𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓)))
6	1, 5	bitr4id 290	1 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  Ⅎwnf 1782  Ⅎwnfc 2890   ≠ wne 2940  ∀wral 3061  ∅c0 4342

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-11 2157  ax-12 2177  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-dif 3969  df-nul 4343

This theorem is referenced by:  iindif2f  45132