Theorem imasaddvallem 17448

Description: The operation of an image structure is defined to distribute over the mapping function. (Contributed by Mario Carneiro, 23-Feb-2015.)

Hypotheses

Ref	Expression
imasaddf.f	⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
imasaddf.e	⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑝 · 𝑞))))
imasaddflem.a	⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})

Assertion

Ref	Expression
imasaddvallem	⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝐹‘𝑋) ∙ (𝐹‘𝑌)) = (𝐹‘(𝑋 · 𝑌)))

Distinct variable groups:   𝑞,𝑝,𝐵   𝑎,𝑏,𝑝,𝑞,𝑉   · ,𝑝,𝑞   𝑋,𝑝   𝐹,𝑎,𝑏,𝑝,𝑞   𝜑,𝑎,𝑏,𝑝,𝑞   ∙ ,𝑎,𝑏,𝑝,𝑞   𝑌,𝑝,𝑞

Allowed substitution hints:   𝐵(𝑎,𝑏)   · (𝑎,𝑏)   𝑋(𝑞,𝑎,𝑏)   𝑌(𝑎,𝑏)

Proof of Theorem imasaddvallem

Step	Hyp	Ref	Expression
1		df-ov 7359	. 2 ⊢ ((𝐹‘𝑋) ∙ (𝐹‘𝑌)) = ( ∙ ‘⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩)
2		imasaddf.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵)
3		imasaddf.e	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑝 · 𝑞))))
4		imasaddflem.a	. . . . . 6 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
5	2, 3, 4	imasaddfnlem 17447	. . . . 5 ⊢ (𝜑 → ∙ Fn (𝐵 × 𝐵))
6		fnfun 6590	. . . . 5 ⊢ ( ∙ Fn (𝐵 × 𝐵) → Fun ∙ )
7	5, 6	syl 17	. . . 4 ⊢ (𝜑 → Fun ∙ )
8	7	3ad2ant1 1133	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → Fun ∙ )
9		fveq2 6832	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑋 → (𝐹‘𝑝) = (𝐹‘𝑋))
10	9	opeq1d 4833	. . . . . . . . . 10 ⊢ (𝑝 = 𝑋 → ⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩ = ⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩)
11		fvoveq1 7379	. . . . . . . . . 10 ⊢ (𝑝 = 𝑋 → (𝐹‘(𝑝 · 𝑌)) = (𝐹‘(𝑋 · 𝑌)))
12	10, 11	opeq12d 4835	. . . . . . . . 9 ⊢ (𝑝 = 𝑋 → ⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩ = ⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩)
13	12	sneqd 4590	. . . . . . . 8 ⊢ (𝑝 = 𝑋 → {⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩} = {⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩})
14	13	ssiun2s 5002	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → {⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩} ⊆ ∪ 𝑝 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩})
15	14	3ad2ant2 1134	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → {⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩} ⊆ ∪ 𝑝 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩})
16		fveq2 6832	. . . . . . . . . . . . 13 ⊢ (𝑞 = 𝑌 → (𝐹‘𝑞) = (𝐹‘𝑌))
17	16	opeq2d 4834	. . . . . . . . . . . 12 ⊢ (𝑞 = 𝑌 → ⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩ = ⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩)
18		oveq2 7364	. . . . . . . . . . . . 13 ⊢ (𝑞 = 𝑌 → (𝑝 · 𝑞) = (𝑝 · 𝑌))
19	18	fveq2d 6836	. . . . . . . . . . . 12 ⊢ (𝑞 = 𝑌 → (𝐹‘(𝑝 · 𝑞)) = (𝐹‘(𝑝 · 𝑌)))
20	17, 19	opeq12d 4835	. . . . . . . . . . 11 ⊢ (𝑞 = 𝑌 → ⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩ = ⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩)
21	20	sneqd 4590	. . . . . . . . . 10 ⊢ (𝑞 = 𝑌 → {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩} = {⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩})
22	21	ssiun2s 5002	. . . . . . . . 9 ⊢ (𝑌 ∈ 𝑉 → {⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩} ⊆ ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
23	22	ralrimivw 3130	. . . . . . . 8 ⊢ (𝑌 ∈ 𝑉 → ∀𝑝 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩} ⊆ ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
24		ss2iun 4963	. . . . . . . 8 ⊢ (∀𝑝 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩} ⊆ ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩} → ∪ 𝑝 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩} ⊆ ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
25	23, 24	syl 17	. . . . . . 7 ⊢ (𝑌 ∈ 𝑉 → ∪ 𝑝 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩} ⊆ ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
26	25	3ad2ant3 1135	. . . . . 6 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ∪ 𝑝 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑌)⟩, (𝐹‘(𝑝 · 𝑌))⟩} ⊆ ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
27	15, 26	sstrd 3942	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → {⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩} ⊆ ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
28	4	3ad2ant1 1133	. . . . 5 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {⟨⟨(𝐹‘𝑝), (𝐹‘𝑞)⟩, (𝐹‘(𝑝 · 𝑞))⟩})
29	27, 28	sseqtrrd 3969	. . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → {⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩} ⊆ ∙ )
30		opex 5410	. . . . 5 ⊢ ⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩ ∈ V
31	30	snss 4739	. . . 4 ⊢ (⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩ ∈ ∙ ↔ {⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩} ⊆ ∙ )
32	29, 31	sylibr 234	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩ ∈ ∙ )
33		funopfv 6881	. . 3 ⊢ (Fun ∙ → (⟨⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩, (𝐹‘(𝑋 · 𝑌))⟩ ∈ ∙ → ( ∙ ‘⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩) = (𝐹‘(𝑋 · 𝑌))))
34	8, 32, 33	sylc 65	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ( ∙ ‘⟨(𝐹‘𝑋), (𝐹‘𝑌)⟩) = (𝐹‘(𝑋 · 𝑌)))
35	1, 34	eqtrid 2781	1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝐹‘𝑋) ∙ (𝐹‘𝑌)) = (𝐹‘(𝑋 · 𝑌)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3049   ⊆ wss 3899  {csn 4578  ⟨cop 4584  ∪ ciun 4944   × cxp 5620  Fun wfun 6484   Fn wfn 6485  –onto→wfo 6488  ‘cfv 6490  (class class class)co 7356

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-fo 6496  df-fv 6498  df-ov 7359

This theorem is referenced by:  imasaddval  17451  imasmulval  17454  qusaddvallem  17470