MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rspec3 Structured version   Visualization version   GIF version

Theorem rspec3 3282
Description: Specialization rule for restricted quantification, with three quantifiers. (Contributed by NM, 20-Nov-1994.)
Hypothesis
Ref Expression
rspec3.1 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 𝜑
Assertion
Ref Expression
rspec3 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) → 𝜑)

Proof of Theorem rspec3
StepHypRef Expression
1 rspec3.1 . . . 4 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐶 𝜑
21rspec2 3281 . . 3 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∀𝑧 ∈ 𝐶 𝜑)
32r19.21bi 3254 . 2 (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 ∈ 𝐶) → 𝜑)
433impa 1127 1 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) → 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145  ∀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  ax-6 2000  ax-7 2041  ax-12 2213
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-ex 1813  df-ral 3077
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator