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

Theorem csbif 4543
Description: Distribute proper substitution through the conditional operator. (Contributed by NM, 24-Feb-2013.) (Revised by NM, 19-Aug-2018.)
Assertion
Ref Expression
csbif 𝐴 / 𝑥if(𝜑, 𝐵, 𝐶) = if([𝐴 / 𝑥]𝜑, 𝐴 / 𝑥𝐵, 𝐴 / 𝑥𝐶)

Proof of Theorem csbif
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 csbeq1 3853 . . . 4 (𝑦 = 𝐴𝑦 / 𝑥if(𝜑, 𝐵, 𝐶) = 𝐴 / 𝑥if(𝜑, 𝐵, 𝐶))
2 dfsbcq2 3745 . . . . 5 (𝑦 = 𝐴 → ([𝑦 / 𝑥]𝜑[𝐴 / 𝑥]𝜑))
3 csbeq1 3853 . . . . 5 (𝑦 = 𝐴𝑦 / 𝑥𝐵 = 𝐴 / 𝑥𝐵)
4 csbeq1 3853 . . . . 5 (𝑦 = 𝐴𝑦 / 𝑥𝐶 = 𝐴 / 𝑥𝐶)
52, 3, 4ifbieq12d 4514 . . . 4 (𝑦 = 𝐴 → if([𝑦 / 𝑥]𝜑, 𝑦 / 𝑥𝐵, 𝑦 / 𝑥𝐶) = if([𝐴 / 𝑥]𝜑, 𝐴 / 𝑥𝐵, 𝐴 / 𝑥𝐶))
61, 5eqeq12d 2778 . . 3 (𝑦 = 𝐴 → (𝑦 / 𝑥if(𝜑, 𝐵, 𝐶) = if([𝑦 / 𝑥]𝜑, 𝑦 / 𝑥𝐵, 𝑦 / 𝑥𝐶) ↔ 𝐴 / 𝑥if(𝜑, 𝐵, 𝐶) = if([𝐴 / 𝑥]𝜑, 𝐴 / 𝑥𝐵, 𝐴 / 𝑥𝐶)))
7 vex 3457 . . . 4 𝑦 ∈ V
8 nfs1v 2193 . . . . 5 𝑥[𝑦 / 𝑥]𝜑
9 nfcsb1v 3874 . . . . 5 𝑥𝑦 / 𝑥𝐵
10 nfcsb1v 3874 . . . . 5 𝑥𝑦 / 𝑥𝐶
118, 9, 10nfif 4516 . . . 4 𝑥if([𝑦 / 𝑥]𝜑, 𝑦 / 𝑥𝐵, 𝑦 / 𝑥𝐶)
12 sbequ12 2288 . . . . 5 (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
13 csbeq1a 3864 . . . . 5 (𝑥 = 𝑦𝐵 = 𝑦 / 𝑥𝐵)
14 csbeq1a 3864 . . . . 5 (𝑥 = 𝑦𝐶 = 𝑦 / 𝑥𝐶)
1512, 13, 14ifbieq12d 4514 . . . 4 (𝑥 = 𝑦 → if(𝜑, 𝐵, 𝐶) = if([𝑦 / 𝑥]𝜑, 𝑦 / 𝑥𝐵, 𝑦 / 𝑥𝐶))
167, 11, 15csbief 3884 . . 3 𝑦 / 𝑥if(𝜑, 𝐵, 𝐶) = if([𝑦 / 𝑥]𝜑, 𝑦 / 𝑥𝐵, 𝑦 / 𝑥𝐶)
176, 16vtoclg 3520 . 2 (𝐴 ∈ V → 𝐴 / 𝑥if(𝜑, 𝐵, 𝐶) = if([𝐴 / 𝑥]𝜑, 𝐴 / 𝑥𝐵, 𝐴 / 𝑥𝐶))
18 csbprc 4370 . . 3 𝐴 ∈ V → 𝐴 / 𝑥if(𝜑, 𝐵, 𝐶) = ∅)
19 csbprc 4370 . . . . 5 𝐴 ∈ V → 𝐴 / 𝑥𝐵 = ∅)
20 csbprc 4370 . . . . 5 𝐴 ∈ V → 𝐴 / 𝑥𝐶 = ∅)
2119, 20ifeq12d 4507 . . . 4 𝐴 ∈ V → if([𝐴 / 𝑥]𝜑, 𝐴 / 𝑥𝐵, 𝐴 / 𝑥𝐶) = if([𝐴 / 𝑥]𝜑, ∅, ∅))
22 ifid 4526 . . . 4 if([𝐴 / 𝑥]𝜑, ∅, ∅) = ∅
2321, 22eqtr2di 2814 . . 3 𝐴 ∈ V → ∅ = if([𝐴 / 𝑥]𝜑, 𝐴 / 𝑥𝐵, 𝐴 / 𝑥𝐶))
2418, 23eqtrd 2797 . 2 𝐴 ∈ V → 𝐴 / 𝑥if(𝜑, 𝐵, 𝐶) = if([𝐴 / 𝑥]𝜑, 𝐴 / 𝑥𝐵, 𝐴 / 𝑥𝐶))
2517, 24pm2.61i 184 1 𝐴 / 𝑥if(𝜑, 𝐵, 𝐶) = if([𝐴 / 𝑥]𝜑, 𝐴 / 𝑥𝐵, 𝐴 / 𝑥𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570  [wsb 2099  wcel 2145  Vcvv 3453  [wsbc 3742  csb 3850  c0 4282  ifcif 4485
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-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-nul 4283  df-if 4486
This theorem is used by:  csbopg  4854  fvmptnn04if  23078  csbrdgg  38085  csbfinxpg  38144  cdlemk40  41792
  Copyright terms: Public domain W3C validator