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

Theorem csbcow 3158
Description: Composition law for chained substitutions into a class. Version of csbco 3157 with a disjoint variable condition, which requires fewer axioms. (Contributed by NM, 10-Nov-2005.) (Revised by GG, 25-Aug-2024.)
Assertion
Ref Expression
csbcow ⦋𝐴 / 𝑦⦌⦋𝑦 / 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐵
Distinct variable groups:   𝑥,𝑦   𝑦,𝐵
Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝐵(𝑥)

Proof of Theorem csbcow
Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-csb 3148 . . . . . 6 ⦋𝑦 / 𝑥⦌𝐵 = {𝑧 ∣ [𝑦 / 𝑥]𝑧 ∈ 𝐵}
21abeq2i 2349 . . . . 5 (𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐵 ↔ [𝑦 / 𝑥]𝑧 ∈ 𝐵)
32sbcbii 3111 . . . 4 ([𝐴 / 𝑦]𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐵 ↔ [𝐴 / 𝑦][𝑦 / 𝑥]𝑧 ∈ 𝐵)
4 nfv 1581 . . . . . . . . . 10 Ⅎ𝑦∀𝑥(𝑥 = 𝑤 → 𝑧 ∈ 𝐵)
5 equequ2 1765 . . . . . . . . . . . 12 (𝑦 = 𝑤 → (𝑥 = 𝑦 ↔ 𝑥 = 𝑤))
65imbi1d 231 . . . . . . . . . . 11 (𝑦 = 𝑤 → ((𝑥 = 𝑦 → 𝑧 ∈ 𝐵) ↔ (𝑥 = 𝑤 → 𝑧 ∈ 𝐵)))
76albidv 1877 . . . . . . . . . 10 (𝑦 = 𝑤 → (∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝑤 → 𝑧 ∈ 𝐵)))
84, 7sbiev 1845 . . . . . . . . 9 ([𝑤 / 𝑦]∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝑤 → 𝑧 ∈ 𝐵))
9 sb6 1941 . . . . . . . . 9 ([𝑤 / 𝑥]𝑧 ∈ 𝐵 ↔ ∀𝑥(𝑥 = 𝑤 → 𝑧 ∈ 𝐵))
108, 9bitr4i 187 . . . . . . . 8 ([𝑤 / 𝑦]∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵) ↔ [𝑤 / 𝑥]𝑧 ∈ 𝐵)
11 df-clab 2225 . . . . . . . 8 (𝑤 ∈ {𝑦 ∣ ∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵)} ↔ [𝑤 / 𝑦]∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵))
12 df-clab 2225 . . . . . . . 8 (𝑤 ∈ {𝑥 ∣ 𝑧 ∈ 𝐵} ↔ [𝑤 / 𝑥]𝑧 ∈ 𝐵)
1310, 11, 123bitr4i 212 . . . . . . 7 (𝑤 ∈ {𝑦 ∣ ∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵)} ↔ 𝑤 ∈ {𝑥 ∣ 𝑧 ∈ 𝐵})
1413eqriv 2235 . . . . . 6 {𝑦 ∣ ∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵)} = {𝑥 ∣ 𝑧 ∈ 𝐵}
1514eleq2i 2305 . . . . 5 (𝐴 ∈ {𝑦 ∣ ∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵)} ↔ 𝐴 ∈ {𝑥 ∣ 𝑧 ∈ 𝐵})
16 df-sbc 3052 . . . . . 6 ([𝐴 / 𝑦][𝑦 / 𝑥]𝑧 ∈ 𝐵 ↔ 𝐴 ∈ {𝑦 ∣ [𝑦 / 𝑥]𝑧 ∈ 𝐵})
17 df-sbc 3052 . . . . . . . . 9 ([𝑦 / 𝑥]𝑧 ∈ 𝐵 ↔ 𝑦 ∈ {𝑥 ∣ 𝑧 ∈ 𝐵})
18 df-clab 2225 . . . . . . . . . 10 (𝑦 ∈ {𝑥 ∣ 𝑧 ∈ 𝐵} ↔ [𝑦 / 𝑥]𝑧 ∈ 𝐵)
19 sb6 1941 . . . . . . . . . 10 ([𝑦 / 𝑥]𝑧 ∈ 𝐵 ↔ ∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵))
2018, 19bitri 184 . . . . . . . . 9 (𝑦 ∈ {𝑥 ∣ 𝑧 ∈ 𝐵} ↔ ∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵))
2117, 20bitri 184 . . . . . . . 8 ([𝑦 / 𝑥]𝑧 ∈ 𝐵 ↔ ∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵))
2221abbii 2354 . . . . . . 7 {𝑦 ∣ [𝑦 / 𝑥]𝑧 ∈ 𝐵} = {𝑦 ∣ ∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵)}
2322eleq2i 2305 . . . . . 6 (𝐴 ∈ {𝑦 ∣ [𝑦 / 𝑥]𝑧 ∈ 𝐵} ↔ 𝐴 ∈ {𝑦 ∣ ∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵)})
2416, 23bitri 184 . . . . 5 ([𝐴 / 𝑦][𝑦 / 𝑥]𝑧 ∈ 𝐵 ↔ 𝐴 ∈ {𝑦 ∣ ∀𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝐵)})
25 df-sbc 3052 . . . . 5 ([𝐴 / 𝑥]𝑧 ∈ 𝐵 ↔ 𝐴 ∈ {𝑥 ∣ 𝑧 ∈ 𝐵})
2615, 24, 253bitr4i 212 . . . 4 ([𝐴 / 𝑦][𝑦 / 𝑥]𝑧 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑧 ∈ 𝐵)
273, 26bitri 184 . . 3 ([𝐴 / 𝑦]𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐵 ↔ [𝐴 / 𝑥]𝑧 ∈ 𝐵)
2827abbii 2354 . 2 {𝑧 ∣ [𝐴 / 𝑦]𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐵} = {𝑧 ∣ [𝐴 / 𝑥]𝑧 ∈ 𝐵}
29 df-csb 3148 . 2 ⦋𝐴 / 𝑦⦌⦋𝑦 / 𝑥⦌𝐵 = {𝑧 ∣ [𝐴 / 𝑦]𝑧 ∈ ⦋𝑦 / 𝑥⦌𝐵}
30 df-csb 3148 . 2 ⦋𝐴 / 𝑥⦌𝐵 = {𝑧 ∣ [𝐴 / 𝑥]𝑧 ∈ 𝐵}
3128, 29, 303eqtr4i 2269 1 ⦋𝐴 / 𝑦⦌⦋𝑦 / 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐵
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4  ∀wal 1400   = wceq 1402  [wsb 1815   ∈ wcel 2209  {cab 2224  [wsbc 3051  ⦋csb 3147
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-11 1559  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-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-sbc 3052  df-csb 3148
This theorem is used by:  zproddc  12365  fprodseq  12369
  Copyright terms: Public domain W3C validator