Theorem rspec3 2567

Description: Specialization rule for restricted quantification. (Contributed by NM, 20-Nov-1994.)

Hypothesis

Ref	Expression
rspec3.1	⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 𝜑

Assertion

Ref	Expression
rspec3	⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) → 𝜑)

Proof of Theorem rspec3

Step	Hyp	Ref	Expression
1		rspec3.1	. . . 4 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 𝜑
2	1	rspec2 2566	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∀𝑧 ∈ 𝐶 𝜑)
3	2	r19.21bi 2565	. 2 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 ∈ 𝐶) → 𝜑)
4	3	3impa 1194	1 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) → 𝜑)

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 978   ∈ wcel 2148  ∀wral 2455

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

This theorem depends on definitions:  df-bi 117  df-3an 980  df-ral 2460

This theorem is referenced by:  ordsoexmid  4560