Theorem restxp 5787

Description: Restriction distributes over tail cross product. (Contributed by SF, 24-Feb-2015.)

Assertion

Ref	Expression
restxp	⊢ ((A ⊗ B) ↾ C) = ((A ↾ C) ⊗ (B ↾ C))

Proof of Theorem restxp

Dummy variables a b x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		anandir 802	. . . . . 6 ⊢ (((xAa ∧ xBb) ∧ x ∈ C) ↔ ((xAa ∧ x ∈ C) ∧ (xBb ∧ x ∈ C)))
2	1	anbi2i 675	. . . . 5 ⊢ ((y = ⟨a, b⟩ ∧ ((xAa ∧ xBb) ∧ x ∈ C)) ↔ (y = ⟨a, b⟩ ∧ ((xAa ∧ x ∈ C) ∧ (xBb ∧ x ∈ C))))
3		3anass 938	. . . . . . 7 ⊢ ((y = ⟨a, b⟩ ∧ xAa ∧ xBb) ↔ (y = ⟨a, b⟩ ∧ (xAa ∧ xBb)))
4	3	anbi1i 676	. . . . . 6 ⊢ (((y = ⟨a, b⟩ ∧ xAa ∧ xBb) ∧ x ∈ C) ↔ ((y = ⟨a, b⟩ ∧ (xAa ∧ xBb)) ∧ x ∈ C))
5		anass 630	. . . . . 6 ⊢ (((y = ⟨a, b⟩ ∧ (xAa ∧ xBb)) ∧ x ∈ C) ↔ (y = ⟨a, b⟩ ∧ ((xAa ∧ xBb) ∧ x ∈ C)))
6	4, 5	bitri 240	. . . . 5 ⊢ (((y = ⟨a, b⟩ ∧ xAa ∧ xBb) ∧ x ∈ C) ↔ (y = ⟨a, b⟩ ∧ ((xAa ∧ xBb) ∧ x ∈ C)))
7		3anass 938	. . . . 5 ⊢ ((y = ⟨a, b⟩ ∧ (xAa ∧ x ∈ C) ∧ (xBb ∧ x ∈ C)) ↔ (y = ⟨a, b⟩ ∧ ((xAa ∧ x ∈ C) ∧ (xBb ∧ x ∈ C))))
8	2, 6, 7	3bitr4i 268	. . . 4 ⊢ (((y = ⟨a, b⟩ ∧ xAa ∧ xBb) ∧ x ∈ C) ↔ (y = ⟨a, b⟩ ∧ (xAa ∧ x ∈ C) ∧ (xBb ∧ x ∈ C)))
9	8	2exbii 1583	. . 3 ⊢ (∃a∃b((y = ⟨a, b⟩ ∧ xAa ∧ xBb) ∧ x ∈ C) ↔ ∃a∃b(y = ⟨a, b⟩ ∧ (xAa ∧ x ∈ C) ∧ (xBb ∧ x ∈ C)))
10		brtxp 5784	. . . . 5 ⊢ (x(A ⊗ B)y ↔ ∃a∃b(y = ⟨a, b⟩ ∧ xAa ∧ xBb))
11	10	anbi1i 676	. . . 4 ⊢ ((x(A ⊗ B)y ∧ x ∈ C) ↔ (∃a∃b(y = ⟨a, b⟩ ∧ xAa ∧ xBb) ∧ x ∈ C))
12		brres 4950	. . . 4 ⊢ (x((A ⊗ B) ↾ C)y ↔ (x(A ⊗ B)y ∧ x ∈ C))
13		19.41vv 1902	. . . 4 ⊢ (∃a∃b((y = ⟨a, b⟩ ∧ xAa ∧ xBb) ∧ x ∈ C) ↔ (∃a∃b(y = ⟨a, b⟩ ∧ xAa ∧ xBb) ∧ x ∈ C))
14	11, 12, 13	3bitr4i 268	. . 3 ⊢ (x((A ⊗ B) ↾ C)y ↔ ∃a∃b((y = ⟨a, b⟩ ∧ xAa ∧ xBb) ∧ x ∈ C))
15		brtxp 5784	. . . 4 ⊢ (x((A ↾ C) ⊗ (B ↾ C))y ↔ ∃a∃b(y = ⟨a, b⟩ ∧ x(A ↾ C)a ∧ x(B ↾ C)b))
16		biid 227	. . . . . 6 ⊢ (y = ⟨a, b⟩ ↔ y = ⟨a, b⟩)
17		brres 4950	. . . . . 6 ⊢ (x(A ↾ C)a ↔ (xAa ∧ x ∈ C))
18		brres 4950	. . . . . 6 ⊢ (x(B ↾ C)b ↔ (xBb ∧ x ∈ C))
19	16, 17, 18	3anbi123i 1140	. . . . 5 ⊢ ((y = ⟨a, b⟩ ∧ x(A ↾ C)a ∧ x(B ↾ C)b) ↔ (y = ⟨a, b⟩ ∧ (xAa ∧ x ∈ C) ∧ (xBb ∧ x ∈ C)))
20	19	2exbii 1583	. . . 4 ⊢ (∃a∃b(y = ⟨a, b⟩ ∧ x(A ↾ C)a ∧ x(B ↾ C)b) ↔ ∃a∃b(y = ⟨a, b⟩ ∧ (xAa ∧ x ∈ C) ∧ (xBb ∧ x ∈ C)))
21	15, 20	bitri 240	. . 3 ⊢ (x((A ↾ C) ⊗ (B ↾ C))y ↔ ∃a∃b(y = ⟨a, b⟩ ∧ (xAa ∧ x ∈ C) ∧ (xBb ∧ x ∈ C)))
22	9, 14, 21	3bitr4i 268	. 2 ⊢ (x((A ⊗ B) ↾ C)y ↔ x((A ↾ C) ⊗ (B ↾ C))y)
23	22	eqbrriv 4852	1 ⊢ ((A ⊗ B) ↾ C) = ((A ↾ C) ⊗ (B ↾ C))

Syntax hints:   ∧ wa 358   ∧ w3a 934  ∃wex 1541   = wceq 1642   ∈ wcel 1710  ⟨cop 4562   class class class wbr 4640   ↾ cres 4775   ⊗ ctxp 5736

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-reu 2622  df-rmo 2623  df-rab 2624  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-pss 3262  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-iota 4340  df-0c 4378  df-addc 4379  df-nnc 4380  df-fin 4381  df-lefin 4441  df-ltfin 4442  df-ncfin 4443  df-tfin 4444  df-evenfin 4445  df-oddfin 4446  df-sfin 4447  df-spfin 4448  df-phi 4566  df-op 4567  df-proj1 4568  df-proj2 4569  df-opab 4624  df-br 4641  df-1st 4724  df-co 4727  df-xp 4785  df-cnv 4786  df-res 4789  df-2nd 4798  df-txp 5737

This theorem is referenced by: (None)