Theorem ralbidb 49610

Description: Formula-building rule for restricted universal quantifier and additional condition (deduction form). See ralbidc 49611 for a more generalized form. (Contributed by Zhi Wang, 6-Sep-2024.)

Hypotheses

Ref	Expression
ralbidb.1	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐵 ∧ 𝜓)))
ralbidb.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜒 ↔ 𝜃))

Assertion

Ref	Expression
ralbidb	⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜒 ↔ ∀𝑥 ∈ 𝐵 (𝜓 → 𝜃)))

Distinct variable group:   𝜑,𝑥

Allowed substitution hints:   𝜓(𝑥)   𝜒(𝑥)   𝜃(𝑥)   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem ralbidb

Step	Hyp	Ref	Expression
1		ralbidb.1	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐵 ∧ 𝜓)))
2		ralbidb.2	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜒 ↔ 𝜃))
3	1, 2	logic1a 49602	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 → 𝜒) ↔ ((𝑥 ∈ 𝐵 ∧ 𝜓) → 𝜃)))
4		impexp 456	. . 3 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝜓) → 𝜃) ↔ (𝑥 ∈ 𝐵 → (𝜓 → 𝜃)))
5	3, 4	bitrdi 290	. 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 → 𝜒) ↔ (𝑥 ∈ 𝐵 → (𝜓 → 𝜃))))
6	5	ralbidv2 3187	1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 𝜒 ↔ ∀𝑥 ∈ 𝐵 (𝜓 → 𝜃)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2146  ∀wral 3082

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943

This proof depends on definitions:  df-bi 210  df-an 402  df-ral 3083

This theorem is used by: (None)