Theorem 3ralbidv 3229

Description: Formula-building rule for restricted universal quantifiers (deduction form.) (Contributed by Scott Fenton, 20-Feb-2025.)

Hypothesis

Ref	Expression
3ralbidv.1	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
3ralbidv	⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 𝜓 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 𝜒))

Distinct variable groups:   𝜑,𝑥   𝜑,𝑦   𝜑,𝑧

Allowed substitution hints:   𝜓(𝑥, 𝑦, 𝑧)   𝜒(𝑥, 𝑦, 𝑧)   𝐴(𝑥, 𝑦, 𝑧)   𝐵(𝑥, 𝑦, 𝑧)   𝐶(𝑥, 𝑦, 𝑧)

Proof of Theorem 3ralbidv

Step	Hyp	Ref	Expression
1		3ralbidv.1	. . 3 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
2	1	ralbidv 3185	. 2 ⊢ (𝜑 → (∀𝑧 ∈ 𝐶 𝜓 ↔ ∀𝑧 ∈ 𝐶 𝜒))
3	2	2ralbidv 3226	1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 𝜓 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wral 3076

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 3077

This theorem is used by:  4ralbidv  3230  nelsubc3lem  50100  resccatlem  50103