Theorem fntxp 5805

Description: If F and G are functions, then their tail cross product is a function over the intersection of their domains. (Contributed by SF, 24-Feb-2015.)

Assertion

Ref	Expression
fntxp	⊢ ((F Fn A ∧ G Fn B) → (F ⊗ G) Fn (A ∩ B))

Proof of Theorem fntxp

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

Step	Hyp	Ref	Expression
1		brtxp 5784	. . . . . . . . . 10 ⊢ (x(F ⊗ G)y ↔ ∃a∃b(y = ⟨a, b⟩ ∧ xFa ∧ xGb))
2		brtxp 5784	. . . . . . . . . 10 ⊢ (x(F ⊗ G)z ↔ ∃c∃d(z = ⟨c, d⟩ ∧ xFc ∧ xGd))
3	1, 2	anbi12i 678	. . . . . . . . 9 ⊢ ((x(F ⊗ G)y ∧ x(F ⊗ G)z) ↔ (∃a∃b(y = ⟨a, b⟩ ∧ xFa ∧ xGb) ∧ ∃c∃d(z = ⟨c, d⟩ ∧ xFc ∧ xGd)))
4		ee4anv 1915	. . . . . . . . 9 ⊢ (∃a∃b∃c∃d((y = ⟨a, b⟩ ∧ xFa ∧ xGb) ∧ (z = ⟨c, d⟩ ∧ xFc ∧ xGd)) ↔ (∃a∃b(y = ⟨a, b⟩ ∧ xFa ∧ xGb) ∧ ∃c∃d(z = ⟨c, d⟩ ∧ xFc ∧ xGd)))
5	3, 4	bitr4i 243	. . . . . . . 8 ⊢ ((x(F ⊗ G)y ∧ x(F ⊗ G)z) ↔ ∃a∃b∃c∃d((y = ⟨a, b⟩ ∧ xFa ∧ xGb) ∧ (z = ⟨c, d⟩ ∧ xFc ∧ xGd)))
6		an6 1261	. . . . . . . . . . 11 ⊢ (((y = ⟨a, b⟩ ∧ xFa ∧ xGb) ∧ (z = ⟨c, d⟩ ∧ xFc ∧ xGd)) ↔ ((y = ⟨a, b⟩ ∧ z = ⟨c, d⟩) ∧ (xFa ∧ xFc) ∧ (xGb ∧ xGd)))
7		fununiq 5518	. . . . . . . . . . . . . . . 16 ⊢ ((Fun F ∧ xFa ∧ xFc) → a = c)
8	7	3expib 1154	. . . . . . . . . . . . . . 15 ⊢ (Fun F → ((xFa ∧ xFc) → a = c))
9		fununiq 5518	. . . . . . . . . . . . . . . 16 ⊢ ((Fun G ∧ xGb ∧ xGd) → b = d)
10	9	3expib 1154	. . . . . . . . . . . . . . 15 ⊢ (Fun G → ((xGb ∧ xGd) → b = d))
11	8, 10	im2anan9 808	. . . . . . . . . . . . . 14 ⊢ ((Fun F ∧ Fun G) → (((xFa ∧ xFc) ∧ (xGb ∧ xGd)) → (a = c ∧ b = d)))
12		eqeq12 2365	. . . . . . . . . . . . . . . 16 ⊢ ((y = ⟨a, b⟩ ∧ z = ⟨c, d⟩) → (y = z ↔ ⟨a, b⟩ = ⟨c, d⟩))
13		opth 4603	. . . . . . . . . . . . . . . 16 ⊢ (⟨a, b⟩ = ⟨c, d⟩ ↔ (a = c ∧ b = d))
14	12, 13	syl6bb 252	. . . . . . . . . . . . . . 15 ⊢ ((y = ⟨a, b⟩ ∧ z = ⟨c, d⟩) → (y = z ↔ (a = c ∧ b = d)))
15	14	imbi2d 307	. . . . . . . . . . . . . 14 ⊢ ((y = ⟨a, b⟩ ∧ z = ⟨c, d⟩) → ((((xFa ∧ xFc) ∧ (xGb ∧ xGd)) → y = z) ↔ (((xFa ∧ xFc) ∧ (xGb ∧ xGd)) → (a = c ∧ b = d))))
16	11, 15	syl5ibrcom 213	. . . . . . . . . . . . 13 ⊢ ((Fun F ∧ Fun G) → ((y = ⟨a, b⟩ ∧ z = ⟨c, d⟩) → (((xFa ∧ xFc) ∧ (xGb ∧ xGd)) → y = z)))
17	16	exp4a 589	. . . . . . . . . . . 12 ⊢ ((Fun F ∧ Fun G) → ((y = ⟨a, b⟩ ∧ z = ⟨c, d⟩) → ((xFa ∧ xFc) → ((xGb ∧ xGd) → y = z))))
18	17	3impd 1165	. . . . . . . . . . 11 ⊢ ((Fun F ∧ Fun G) → (((y = ⟨a, b⟩ ∧ z = ⟨c, d⟩) ∧ (xFa ∧ xFc) ∧ (xGb ∧ xGd)) → y = z))
19	6, 18	syl5bi 208	. . . . . . . . . 10 ⊢ ((Fun F ∧ Fun G) → (((y = ⟨a, b⟩ ∧ xFa ∧ xGb) ∧ (z = ⟨c, d⟩ ∧ xFc ∧ xGd)) → y = z))
20	19	exlimdvv 1637	. . . . . . . . 9 ⊢ ((Fun F ∧ Fun G) → (∃c∃d((y = ⟨a, b⟩ ∧ xFa ∧ xGb) ∧ (z = ⟨c, d⟩ ∧ xFc ∧ xGd)) → y = z))
21	20	exlimdvv 1637	. . . . . . . 8 ⊢ ((Fun F ∧ Fun G) → (∃a∃b∃c∃d((y = ⟨a, b⟩ ∧ xFa ∧ xGb) ∧ (z = ⟨c, d⟩ ∧ xFc ∧ xGd)) → y = z))
22	5, 21	syl5bi 208	. . . . . . 7 ⊢ ((Fun F ∧ Fun G) → ((x(F ⊗ G)y ∧ x(F ⊗ G)z) → y = z))
23	22	alrimiv 1631	. . . . . 6 ⊢ ((Fun F ∧ Fun G) → ∀z((x(F ⊗ G)y ∧ x(F ⊗ G)z) → y = z))
24	23	alrimivv 1632	. . . . 5 ⊢ ((Fun F ∧ Fun G) → ∀x∀y∀z((x(F ⊗ G)y ∧ x(F ⊗ G)z) → y = z))
25		dffun2 5120	. . . . 5 ⊢ (Fun (F ⊗ G) ↔ ∀x∀y∀z((x(F ⊗ G)y ∧ x(F ⊗ G)z) → y = z))
26	24, 25	sylibr 203	. . . 4 ⊢ ((Fun F ∧ Fun G) → Fun (F ⊗ G))
27		dmtxp 5803	. . . . 5 ⊢ dom (F ⊗ G) = (dom F ∩ dom G)
28		ineq12 3453	. . . . 5 ⊢ ((dom F = A ∧ dom G = B) → (dom F ∩ dom G) = (A ∩ B))
29	27, 28	syl5eq 2397	. . . 4 ⊢ ((dom F = A ∧ dom G = B) → dom (F ⊗ G) = (A ∩ B))
30	26, 29	anim12i 549	. . 3 ⊢ (((Fun F ∧ Fun G) ∧ (dom F = A ∧ dom G = B)) → (Fun (F ⊗ G) ∧ dom (F ⊗ G) = (A ∩ B)))
31	30	an4s 799	. 2 ⊢ (((Fun F ∧ dom F = A) ∧ (Fun G ∧ dom G = B)) → (Fun (F ⊗ G) ∧ dom (F ⊗ G) = (A ∩ B)))
32		df-fn 4791	. . 3 ⊢ (F Fn A ↔ (Fun F ∧ dom F = A))
33		df-fn 4791	. . 3 ⊢ (G Fn B ↔ (Fun G ∧ dom G = B))
34	32, 33	anbi12i 678	. 2 ⊢ ((F Fn A ∧ G Fn B) ↔ ((Fun F ∧ dom F = A) ∧ (Fun G ∧ dom G = B)))
35		df-fn 4791	. 2 ⊢ ((F ⊗ G) Fn (A ∩ B) ↔ (Fun (F ⊗ G) ∧ dom (F ⊗ G) = (A ∩ B)))
36	31, 34, 35	3imtr4i 257	1 ⊢ ((F Fn A ∧ G Fn B) → (F ⊗ G) Fn (A ∩ B))

This proof depends on syntax axioms:   → wi 4   ∧ wa 358   ∧ w3a 934  ∀wal 1540  ∃wex 1541   = wceq 1642   ∩ cin 3209  ⟨cop 4562   class class class wbr 4640  dom cdm 4773  Fun wfun 4776   Fn wfn 4777   ⊗ ctxp 5736

This proof depends on 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 proof 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-ima 4728  df-id 4768  df-cnv 4786  df-rn 4787  df-dm 4788  df-fun 4790  df-fn 4791  df-2nd 4798  df-txp 5737

This theorem is used by:  xpassen  6058