ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  rspc2gv GIF version

Theorem rspc2gv 2942
Description: Restricted specialization with two quantifiers, using implicit substitution. (Contributed by BJ, 2-Dec-2021.)
Hypothesis
Ref Expression
rspc2gv.1 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
rspc2gv ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑊 𝜑 → 𝜓))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝑉,𝑦   𝑥,𝑊,𝑦   𝜓,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem rspc2gv
StepHypRef Expression
1 df-ral 2533 . 2 (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑊 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝑉 → ∀𝑦 ∈ 𝑊 𝜑))
2 df-ral 2533 . . . . 5 (∀𝑦 ∈ 𝑊 𝜑 ↔ ∀𝑦(𝑦 ∈ 𝑊 → 𝜑))
32imbi2i 226 . . . 4 ((𝑥 ∈ 𝑉 → ∀𝑦 ∈ 𝑊 𝜑) ↔ (𝑥 ∈ 𝑉 → ∀𝑦(𝑦 ∈ 𝑊 → 𝜑)))
43albii 1523 . . 3 (∀𝑥(𝑥 ∈ 𝑉 → ∀𝑦 ∈ 𝑊 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝑉 → ∀𝑦(𝑦 ∈ 𝑊 → 𝜑)))
5 19.21v 1926 . . . . . 6 (∀𝑦(𝑥 ∈ 𝑉 → (𝑦 ∈ 𝑊 → 𝜑)) ↔ (𝑥 ∈ 𝑉 → ∀𝑦(𝑦 ∈ 𝑊 → 𝜑)))
65bicomi 132 . . . . 5 ((𝑥 ∈ 𝑉 → ∀𝑦(𝑦 ∈ 𝑊 → 𝜑)) ↔ ∀𝑦(𝑥 ∈ 𝑉 → (𝑦 ∈ 𝑊 → 𝜑)))
76albii 1523 . . . 4 (∀𝑥(𝑥 ∈ 𝑉 → ∀𝑦(𝑦 ∈ 𝑊 → 𝜑)) ↔ ∀𝑥∀𝑦(𝑥 ∈ 𝑉 → (𝑦 ∈ 𝑊 → 𝜑)))
8 impexp 263 . . . . . . 7 (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑊) → 𝜑) ↔ (𝑥 ∈ 𝑉 → (𝑦 ∈ 𝑊 → 𝜑)))
9 eleq1 2301 . . . . . . . . 9 (𝑥 = 𝐴 → (𝑥 ∈ 𝑉 ↔ 𝐴 ∈ 𝑉))
10 eleq1 2301 . . . . . . . . 9 (𝑦 = 𝐵 → (𝑦 ∈ 𝑊 ↔ 𝐵 ∈ 𝑊))
119, 10bi2anan9 614 . . . . . . . 8 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑊) ↔ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)))
12 rspc2gv.1 . . . . . . . 8 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓))
1311, 12imbi12d 234 . . . . . . 7 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑊) → 𝜑) ↔ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝜓)))
148, 13bitr3id 194 . . . . . 6 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 ∈ 𝑉 → (𝑦 ∈ 𝑊 → 𝜑)) ↔ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝜓)))
1514spc2gv 2916 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥∀𝑦(𝑥 ∈ 𝑉 → (𝑦 ∈ 𝑊 → 𝜑)) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝜓)))
1615pm2.43a 51 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥∀𝑦(𝑥 ∈ 𝑉 → (𝑦 ∈ 𝑊 → 𝜑)) → 𝜓))
177, 16biimtrid 152 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥(𝑥 ∈ 𝑉 → ∀𝑦(𝑦 ∈ 𝑊 → 𝜑)) → 𝜓))
184, 17biimtrid 152 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥(𝑥 ∈ 𝑉 → ∀𝑦 ∈ 𝑊 𝜑) → 𝜓))
191, 18biimtrid 152 1 ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑊 𝜑 → 𝜓))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1400   = wceq 1402   ∈ wcel 2209  ∀wral 2528
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-ral 2533  df-v 2823
This theorem is used by:  fvdifsuppst  6484  difinfsnlem  7440  difinfsn  7441  seqvalcd  10913  seqovcd  10919  qtopbasss  15713  dichmul0orlem3  16921  dichmul0orlem7  16925  apdiff  17264
  Copyright terms: Public domain W3C validator