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

Theorem csbopg 4854
Description: Distribution of class substitution over ordered pairs. (Contributed by Drahflow, 25-Sep-2015.) (Revised by Mario Carneiro, 29-Oct-2015.) (Revised by ML, 25-Oct-2020.)
Assertion
Ref Expression
csbopg (𝐴𝑉𝐴 / 𝑥𝐶, 𝐷⟩ = ⟨𝐴 / 𝑥𝐶, 𝐴 / 𝑥𝐷⟩)

Proof of Theorem csbopg
StepHypRef Expression
1 csbif 4543 . . 3 𝐴 / 𝑥if((𝐶 ∈ V ∧ 𝐷 ∈ V), {{𝐶}, {𝐶, 𝐷}}, ∅) = if([𝐴 / 𝑥](𝐶 ∈ V ∧ 𝐷 ∈ V), 𝐴 / 𝑥{{𝐶}, {𝐶, 𝐷}}, 𝐴 / 𝑥∅)
2 sbcan 3791 . . . . 5 ([𝐴 / 𝑥](𝐶 ∈ V ∧ 𝐷 ∈ V) ↔ ([𝐴 / 𝑥]𝐶 ∈ V ∧ [𝐴 / 𝑥]𝐷 ∈ V))
3 sbcel1g 4377 . . . . . 6 (𝐴𝑉 → ([𝐴 / 𝑥]𝐶 ∈ V ↔ 𝐴 / 𝑥𝐶 ∈ V))
4 sbcel1g 4377 . . . . . 6 (𝐴𝑉 → ([𝐴 / 𝑥]𝐷 ∈ V ↔ 𝐴 / 𝑥𝐷 ∈ V))
53, 4anbi12d 644 . . . . 5 (𝐴𝑉 → (([𝐴 / 𝑥]𝐶 ∈ V ∧ [𝐴 / 𝑥]𝐷 ∈ V) ↔ (𝐴 / 𝑥𝐶 ∈ V ∧ 𝐴 / 𝑥𝐷 ∈ V)))
62, 5bitrid 286 . . . 4 (𝐴𝑉 → ([𝐴 / 𝑥](𝐶 ∈ V ∧ 𝐷 ∈ V) ↔ (𝐴 / 𝑥𝐶 ∈ V ∧ 𝐴 / 𝑥𝐷 ∈ V)))
7 csbprg 4673 . . . . 5 (𝐴𝑉𝐴 / 𝑥{{𝐶}, {𝐶, 𝐷}} = {𝐴 / 𝑥{𝐶}, 𝐴 / 𝑥{𝐶, 𝐷}})
8 csbsng 4672 . . . . . 6 (𝐴𝑉𝐴 / 𝑥{𝐶} = {𝐴 / 𝑥𝐶})
9 csbprg 4673 . . . . . 6 (𝐴𝑉𝐴 / 𝑥{𝐶, 𝐷} = {𝐴 / 𝑥𝐶, 𝐴 / 𝑥𝐷})
108, 9preq12d 4705 . . . . 5 (𝐴𝑉 → {𝐴 / 𝑥{𝐶}, 𝐴 / 𝑥{𝐶, 𝐷}} = {{𝐴 / 𝑥𝐶}, {𝐴 / 𝑥𝐶, 𝐴 / 𝑥𝐷}})
117, 10eqtrd 2797 . . . 4 (𝐴𝑉𝐴 / 𝑥{{𝐶}, {𝐶, 𝐷}} = {{𝐴 / 𝑥𝐶}, {𝐴 / 𝑥𝐶, 𝐴 / 𝑥𝐷}})
12 csbconstg 3869 . . . 4 (𝐴𝑉𝐴 / 𝑥∅ = ∅)
136, 11, 12ifbieq12d 4514 . . 3 (𝐴𝑉 → if([𝐴 / 𝑥](𝐶 ∈ V ∧ 𝐷 ∈ V), 𝐴 / 𝑥{{𝐶}, {𝐶, 𝐷}}, 𝐴 / 𝑥∅) = if((𝐴 / 𝑥𝐶 ∈ V ∧ 𝐴 / 𝑥𝐷 ∈ V), {{𝐴 / 𝑥𝐶}, {𝐴 / 𝑥𝐶, 𝐴 / 𝑥𝐷}}, ∅))
141, 13eqtrid 2809 . 2 (𝐴𝑉𝐴 / 𝑥if((𝐶 ∈ V ∧ 𝐷 ∈ V), {{𝐶}, {𝐶, 𝐷}}, ∅) = if((𝐴 / 𝑥𝐶 ∈ V ∧ 𝐴 / 𝑥𝐷 ∈ V), {{𝐴 / 𝑥𝐶}, {𝐴 / 𝑥𝐶, 𝐴 / 𝑥𝐷}}, ∅))
15 dfopif 4833 . . 3 𝐶, 𝐷⟩ = if((𝐶 ∈ V ∧ 𝐷 ∈ V), {{𝐶}, {𝐶, 𝐷}}, ∅)
1615csbeq2i 3858 . 2 𝐴 / 𝑥𝐶, 𝐷⟩ = 𝐴 / 𝑥if((𝐶 ∈ V ∧ 𝐷 ∈ V), {{𝐶}, {𝐶, 𝐷}}, ∅)
17 dfopif 4833 . 2 𝐴 / 𝑥𝐶, 𝐴 / 𝑥𝐷⟩ = if((𝐴 / 𝑥𝐶 ∈ V ∧ 𝐴 / 𝑥𝐷 ∈ V), {{𝐴 / 𝑥𝐶}, {𝐴 / 𝑥𝐶, 𝐴 / 𝑥𝐷}}, ∅)
1814, 16, 173eqtr4g 2822 1 (𝐴𝑉𝐴 / 𝑥𝐶, 𝐷⟩ = ⟨𝐴 / 𝑥𝐶, 𝐴 / 𝑥𝐷⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  Vcvv 3453  [wsbc 3742  csb 3850  c0 4282  ifcif 4485  {csn 4587  {cpr 4589  cop 4593
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-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594
This theorem is used by:  sbcop  5469  opsbc2ie  32959  esum2dlem  34610  csbfinxpg  38150
  Copyright terms: Public domain W3C validator