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

Theorem xpiundi 4325
 Description: Distributive law for cross product over indexed union. (Contributed by Mario Carneiro, 27-Apr-2014.)
Assertion
Ref Expression
xpiundi (𝐶 × x A B) = x A (𝐶 × B)
Distinct variable group:   x,𝐶
Allowed substitution hints:   A(x)   B(x)

Proof of Theorem xpiundi
Dummy variables y w z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rexcom 2452 . . . 4 (w 𝐶 x A y B z = ⟨w, y⟩ ↔ x A w 𝐶 y B z = ⟨w, y⟩)
2 eliun 3635 . . . . . . . 8 (y x A Bx A y B)
32anbi1i 434 . . . . . . 7 ((y x A B z = ⟨w, y⟩) ↔ (x A y B z = ⟨w, y⟩))
43exbii 1478 . . . . . 6 (y(y x A B z = ⟨w, y⟩) ↔ y(x A y B z = ⟨w, y⟩))
5 df-rex 2290 . . . . . 6 (y x A Bz = ⟨w, y⟩ ↔ y(y x A B z = ⟨w, y⟩))
6 df-rex 2290 . . . . . . . 8 (y B z = ⟨w, y⟩ ↔ y(y B z = ⟨w, y⟩))
76rexbii 2309 . . . . . . 7 (x A y B z = ⟨w, y⟩ ↔ x A y(y B z = ⟨w, y⟩))
8 rexcom4 2554 . . . . . . 7 (x A y(y B z = ⟨w, y⟩) ↔ yx A (y B z = ⟨w, y⟩))
9 r19.41v 2444 . . . . . . . 8 (x A (y B z = ⟨w, y⟩) ↔ (x A y B z = ⟨w, y⟩))
109exbii 1478 . . . . . . 7 (yx A (y B z = ⟨w, y⟩) ↔ y(x A y B z = ⟨w, y⟩))
117, 8, 103bitri 195 . . . . . 6 (x A y B z = ⟨w, y⟩ ↔ y(x A y B z = ⟨w, y⟩))
124, 5, 113bitr4i 201 . . . . 5 (y x A Bz = ⟨w, y⟩ ↔ x A y B z = ⟨w, y⟩)
1312rexbii 2309 . . . 4 (w 𝐶 y x A Bz = ⟨w, y⟩ ↔ w 𝐶 x A y B z = ⟨w, y⟩)
14 elxp2 4290 . . . . 5 (z (𝐶 × B) ↔ w 𝐶 y B z = ⟨w, y⟩)
1514rexbii 2309 . . . 4 (x A z (𝐶 × B) ↔ x A w 𝐶 y B z = ⟨w, y⟩)
161, 13, 153bitr4i 201 . . 3 (w 𝐶 y x A Bz = ⟨w, y⟩ ↔ x A z (𝐶 × B))
17 elxp2 4290 . . 3 (z (𝐶 × x A B) ↔ w 𝐶 y x A Bz = ⟨w, y⟩)
18 eliun 3635 . . 3 (z x A (𝐶 × B) ↔ x A z (𝐶 × B))
1916, 17, 183bitr4i 201 . 2 (z (𝐶 × x A B) ↔ z x A (𝐶 × B))
2019eqriv 2019 1 (𝐶 × x A B) = x A (𝐶 × B)
 Colors of variables: wff set class Syntax hints:   ∧ wa 97   = wceq 1228  ∃wex 1362   ∈ wcel 1374  ∃wrex 2285  ⟨cop 3353  ∪ ciun 3631   × cxp 4270 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 617  ax-5 1316  ax-7 1317  ax-gen 1318  ax-ie1 1363  ax-ie2 1364  ax-8 1376  ax-10 1377  ax-11 1378  ax-i12 1379  ax-bnd 1380  ax-4 1381  ax-14 1386  ax-17 1400  ax-i9 1404  ax-ial 1409  ax-i5r 1410  ax-ext 2004  ax-sep 3849  ax-pow 3901  ax-pr 3918 This theorem depends on definitions:  df-bi 110  df-3an 875  df-tru 1231  df-nf 1330  df-sb 1628  df-clab 2009  df-cleq 2015  df-clel 2018  df-nfc 2149  df-ral 2289  df-rex 2290  df-v 2537  df-un 2899  df-in 2901  df-ss 2908  df-pw 3336  df-sn 3356  df-pr 3357  df-op 3359  df-iun 3633  df-opab 3793  df-xp 4278 This theorem is referenced by:  xpexgALT  5683
 Copyright terms: Public domain W3C validator