Theorem r19.28zf 44999

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 3113	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓))
2		r19.28zf.1	. . . 4 ⊢ Ⅎ𝑥𝜑
3		r19.28zf.2	. . . 4 ⊢ Ⅎ𝑥𝐴
4	2, 3	r19.3rzf 44998	. . 3 ⊢ (𝐴 ≠ ∅ → (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑))
5	4	anbi1d 630	. 2 ⊢ (𝐴 ≠ ∅ → ((𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓)))
6	1, 5	bitr4id 290	1 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395  Ⅎwnf 1781  Ⅎwnfc 2888   ≠ wne 2942  ∀wral 3063  ∅c0 4347

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2105  ax-9 2113  ax-11 2153  ax-12 2173  ax-ext 2705

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2890  df-ne 2943  df-ral 3064  df-dif 3973  df-nul 4348

This theorem is referenced by:  iindif2f  45000