Theorem caofcan 44319

Description: Transfer a cancellation law like mulcan 11898 to the function operation. (Contributed by Steve Rodriguez, 16-Nov-2015.)

Hypotheses

Ref	Expression
caofcan.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
caofcan.2	⊢ (𝜑 → 𝐹:𝐴⟶𝑇)
caofcan.3	⊢ (𝜑 → 𝐺:𝐴⟶𝑆)
caofcan.4	⊢ (𝜑 → 𝐻:𝐴⟶𝑆)
caofcan.5	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝑅𝑦) = (𝑥𝑅𝑧) ↔ 𝑦 = 𝑧))

Assertion

Ref	Expression
caofcan	⊢ (𝜑 → ((𝐹 ∘f 𝑅𝐺) = (𝐹 ∘f 𝑅𝐻) ↔ 𝐺 = 𝐻))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐹   𝑥,𝐺,𝑦,𝑧   𝑥,𝐻,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝑇,𝑦,𝑧

Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧)   𝑉(𝑥,𝑦,𝑧)

Proof of Theorem caofcan

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caofcan.2	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴⟶𝑇)
2	1	ffnd 6738	. . . . . 6 ⊢ (𝜑 → 𝐹 Fn 𝐴)
3		caofcan.3	. . . . . . 7 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆)
4	3	ffnd 6738	. . . . . 6 ⊢ (𝜑 → 𝐺 Fn 𝐴)
5		caofcan.1	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
6		inidm 4235	. . . . . 6 ⊢ (𝐴 ∩ 𝐴) = 𝐴
7		eqidd 2736	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) = (𝐹‘𝑤))
8		eqidd 2736	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) = (𝐺‘𝑤))
9	2, 4, 5, 5, 6, 7, 8	ofval 7708	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹 ∘f 𝑅𝐺)‘𝑤) = ((𝐹‘𝑤)𝑅(𝐺‘𝑤)))
10		caofcan.4	. . . . . . 7 ⊢ (𝜑 → 𝐻:𝐴⟶𝑆)
11	10	ffnd 6738	. . . . . 6 ⊢ (𝜑 → 𝐻 Fn 𝐴)
12		eqidd 2736	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐻‘𝑤) = (𝐻‘𝑤))
13	2, 11, 5, 5, 6, 7, 12	ofval 7708	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹 ∘f 𝑅𝐻)‘𝑤) = ((𝐹‘𝑤)𝑅(𝐻‘𝑤)))
14	9, 13	eqeq12d 2751	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (((𝐹 ∘f 𝑅𝐺)‘𝑤) = ((𝐹 ∘f 𝑅𝐻)‘𝑤) ↔ ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = ((𝐹‘𝑤)𝑅(𝐻‘𝑤))))
15		simpl 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → 𝜑)
16	1	ffvelcdmda 7104	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑇)
17	3	ffvelcdmda 7104	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆)
18	10	ffvelcdmda 7104	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐻‘𝑤) ∈ 𝑆)
19		caofcan.5	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑇 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝑅𝑦) = (𝑥𝑅𝑧) ↔ 𝑦 = 𝑧))
20	19	caovcang 7634	. . . . 5 ⊢ ((𝜑 ∧ ((𝐹‘𝑤) ∈ 𝑇 ∧ (𝐺‘𝑤) ∈ 𝑆 ∧ (𝐻‘𝑤) ∈ 𝑆)) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = ((𝐹‘𝑤)𝑅(𝐻‘𝑤)) ↔ (𝐺‘𝑤) = (𝐻‘𝑤)))
21	15, 16, 17, 18, 20	syl13anc 1371	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = ((𝐹‘𝑤)𝑅(𝐻‘𝑤)) ↔ (𝐺‘𝑤) = (𝐻‘𝑤)))
22	14, 21	bitrd 279	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (((𝐹 ∘f 𝑅𝐺)‘𝑤) = ((𝐹 ∘f 𝑅𝐻)‘𝑤) ↔ (𝐺‘𝑤) = (𝐻‘𝑤)))
23	22	ralbidva 3174	. 2 ⊢ (𝜑 → (∀𝑤 ∈ 𝐴 ((𝐹 ∘f 𝑅𝐺)‘𝑤) = ((𝐹 ∘f 𝑅𝐻)‘𝑤) ↔ ∀𝑤 ∈ 𝐴 (𝐺‘𝑤) = (𝐻‘𝑤)))
24	2, 4, 5, 5, 6	offn 7710	. . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) Fn 𝐴)
25	2, 11, 5, 5, 6	offn 7710	. . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐻) Fn 𝐴)
26		eqfnfv 7051	. . 3 ⊢ (((𝐹 ∘f 𝑅𝐺) Fn 𝐴 ∧ (𝐹 ∘f 𝑅𝐻) Fn 𝐴) → ((𝐹 ∘f 𝑅𝐺) = (𝐹 ∘f 𝑅𝐻) ↔ ∀𝑤 ∈ 𝐴 ((𝐹 ∘f 𝑅𝐺)‘𝑤) = ((𝐹 ∘f 𝑅𝐻)‘𝑤)))
27	24, 25, 26	syl2anc 584	. 2 ⊢ (𝜑 → ((𝐹 ∘f 𝑅𝐺) = (𝐹 ∘f 𝑅𝐻) ↔ ∀𝑤 ∈ 𝐴 ((𝐹 ∘f 𝑅𝐺)‘𝑤) = ((𝐹 ∘f 𝑅𝐻)‘𝑤)))
28		eqfnfv 7051	. . 3 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐻 Fn 𝐴) → (𝐺 = 𝐻 ↔ ∀𝑤 ∈ 𝐴 (𝐺‘𝑤) = (𝐻‘𝑤)))
29	4, 11, 28	syl2anc 584	. 2 ⊢ (𝜑 → (𝐺 = 𝐻 ↔ ∀𝑤 ∈ 𝐴 (𝐺‘𝑤) = (𝐻‘𝑤)))
30	23, 27, 29	3bitr4d 311	1 ⊢ (𝜑 → ((𝐹 ∘f 𝑅𝐺) = (𝐹 ∘f 𝑅𝐻) ↔ 𝐺 = 𝐻))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106  ∀wral 3059   Fn wfn 6558  ⟶wf 6559  ‘cfv 6563  (class class class)co 7431   ∘_f cof 7695

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-of 7697

This theorem is referenced by: (None)