Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rspc2daf Structured version   Visualization version   GIF version

Theorem rspc2daf 33135
Description: Double restricted specialization, using implicit substitution. (Contributed by Thierry Arnoux, 4-Jul-2023.)
Hypotheses
Ref Expression
sbc2iedf.1 Ⅎ𝑥𝜑
sbc2iedf.2 Ⅎ𝑦𝜑
sbc2iedf.3 Ⅎ𝑥𝜒
sbc2iedf.4 Ⅎ𝑦𝜒
sbc2iedf.5 (𝜑 → 𝐴 ∈ 𝑉)
sbc2iedf.6 (𝜑 → 𝐵 ∈ 𝑊)
sbc2iedf.7 ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
rspc2daf.8 (𝜑 → ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑊 𝜓)
Assertion
Ref Expression
rspc2daf (𝜑 → 𝜒)
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑉   𝑥,𝑊,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦)   𝜒(𝑥, 𝑦)   𝑉(𝑦)

Proof of Theorem rspc2daf
StepHypRef Expression
1 rspc2daf.8 . . . 4 (𝜑 → ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑊 𝜓)
2 sbc2iedf.1 . . . . 5 Ⅎ𝑥𝜑
3 nfcv 2926 . . . . . 6 Ⅎ𝑥𝑊
4 nfsbc1v 3762 . . . . . 6 Ⅎ𝑥[𝐴 / 𝑥]𝜓
53, 4nfralw 3313 . . . . 5 Ⅎ𝑥∀𝑦 ∈ 𝑊 [𝐴 / 𝑥]𝜓
6 sbc2iedf.5 . . . . 5 (𝜑 → 𝐴 ∈ 𝑉)
7 sbc2iedf.2 . . . . . . 7 Ⅎ𝑦𝜑
8 nfv 1949 . . . . . . 7 Ⅎ𝑦 𝑥 = 𝐴
97, 8nfan 1934 . . . . . 6 Ⅎ𝑦(𝜑 ∧ 𝑥 = 𝐴)
10 sbceq1a 3753 . . . . . . 7 (𝑥 = 𝐴 → (𝜓 ↔ [𝐴 / 𝑥]𝜓))
1110adantl 487 . . . . . 6 ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ [𝐴 / 𝑥]𝜓))
129, 11ralbid 3279 . . . . 5 ((𝜑 ∧ 𝑥 = 𝐴) → (∀𝑦 ∈ 𝑊 𝜓 ↔ ∀𝑦 ∈ 𝑊 [𝐴 / 𝑥]𝜓))
132, 5, 6, 12rspcdf 3567 . . . 4 (𝜑 → (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑊 𝜓 → ∀𝑦 ∈ 𝑊 [𝐴 / 𝑥]𝜓))
141, 13mpd 16 . . 3 (𝜑 → ∀𝑦 ∈ 𝑊 [𝐴 / 𝑥]𝜓)
15 nfsbc1v 3762 . . . 4 Ⅎ𝑦[𝐵 / 𝑦][𝐴 / 𝑥]𝜓
16 sbc2iedf.6 . . . 4 (𝜑 → 𝐵 ∈ 𝑊)
17 sbceq1a 3753 . . . . 5 (𝑦 = 𝐵 → ([𝐴 / 𝑥]𝜓 ↔ [𝐵 / 𝑦][𝐴 / 𝑥]𝜓))
1817adantl 487 . . . 4 ((𝜑 ∧ 𝑦 = 𝐵) → ([𝐴 / 𝑥]𝜓 ↔ [𝐵 / 𝑦][𝐴 / 𝑥]𝜓))
197, 15, 16, 18rspcdf 3567 . . 3 (𝜑 → (∀𝑦 ∈ 𝑊 [𝐴 / 𝑥]𝜓 → [𝐵 / 𝑦][𝐴 / 𝑥]𝜓))
2014, 19mpd 16 . 2 (𝜑 → [𝐵 / 𝑦][𝐴 / 𝑥]𝜓)
21 sbc2iedf.3 . . . 4 Ⅎ𝑥𝜒
22 sbc2iedf.4 . . . 4 Ⅎ𝑦𝜒
23 sbc2iedf.7 . . . 4 ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒))
242, 7, 21, 22, 6, 16, 23sbc2iedf 33134 . . 3 (𝜑 → ([𝐴 / 𝑥][𝐵 / 𝑦]𝜓 ↔ 𝜒))
25 sbccom 3822 . . 3 ([𝐴 / 𝑥][𝐵 / 𝑦]𝜓 ↔ [𝐵 / 𝑦][𝐴 / 𝑥]𝜓)
2624, 25bitr3di 289 . 2 (𝜑 → (𝜒 ↔ [𝐵 / 𝑦][𝐴 / 𝑥]𝜓))
2720, 26mpbird 260 1 (𝜑 → 𝜒)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2147  ∀wral 3080  [wsbc 3742
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-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-v 3456  df-sbc 3743
This theorem is used by:  opreu2reuALT  33145
  Copyright terms: Public domain W3C validator