Theorem rspc2 3588

Description: Restricted specialization with two quantifiers, using implicit substitution. (Contributed by NM, 9-Nov-2012.)

Hypotheses

Ref	Expression
rspc2.1	⊢ Ⅎ𝑥𝜒
rspc2.2	⊢ Ⅎ𝑦𝜓
rspc2.3	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜒))
rspc2.4	⊢ (𝑦 = 𝐵 → (𝜒 ↔ 𝜓))

Assertion

Ref	Expression
rspc2	⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐷 𝜑 → 𝜓))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵   𝑥,𝐶   𝑥,𝐷,𝑦

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

Proof of Theorem rspc2

Step	Hyp	Ref	Expression
1		nfcv 2926	. . . 4 ⊢ Ⅎ𝑥𝐷
2		rspc2.1	. . . 4 ⊢ Ⅎ𝑥𝜒
3	1, 2	nfralw 3313	. . 3 ⊢ Ⅎ𝑥∀𝑦 ∈ 𝐷 𝜒
4		rspc2.3	. . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜒))
5	4	ralbidv 3189	. . 3 ⊢ (𝑥 = 𝐴 → (∀𝑦 ∈ 𝐷 𝜑 ↔ ∀𝑦 ∈ 𝐷 𝜒))
6	3, 5	rspc 3568	. 2 ⊢ (𝐴 ∈ 𝐶 → (∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐷 𝜑 → ∀𝑦 ∈ 𝐷 𝜒))
7		rspc2.2	. . 3 ⊢ Ⅎ𝑦𝜓
8		rspc2.4	. . 3 ⊢ (𝑦 = 𝐵 → (𝜒 ↔ 𝜓))
9	7, 8	rspc 3568	. 2 ⊢ (𝐵 ∈ 𝐷 → (∀𝑦 ∈ 𝐷 𝜒 → 𝜓))
10	6, 9	sylan9 517	1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐷 𝜑 → 𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2147  ∀wral 3080

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-nf 1817  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081

This theorem is used by:  reu2eqd  3697  reuop  6322  fvmpocurryd  8326  dvmptfsum  26350  poimirlem26  38832  fphpd  44089  reupr  48877