Theorem caofidlcan 7713

Description: Transfer a cancellation/identity law to the function operation. (Contributed by SN, 16-Oct-2025.)

Hypotheses

Ref	Expression
caofref.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
caofref.2	⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
caofcom.3	⊢ (𝜑 → 𝐺:𝐴⟶𝑆)
caofidlcan.4	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ((𝑥𝑅𝑦) = 𝑦 ↔ 𝑥 = 0 ))

Assertion

Ref	Expression
caofidlcan	⊢ (𝜑 → ((𝐹 ∘f 𝑅𝐺) = 𝐺 ↔ 𝐹 = (𝐴 × { 0 })))

Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝐺,𝑦   𝜑,𝑥,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦   𝑥, 0 ,𝑦

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

Proof of Theorem caofidlcan

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caofref.2	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
2	1	ffvelcdmda 7080	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆)
3		caofcom.3	. . . . . . 7 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆)
4	3	ffvelcdmda 7080	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆)
5	2, 4	jca 520	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆))
6		caofidlcan.4	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ((𝑥𝑅𝑦) = 𝑦 ↔ 𝑥 = 0 ))
7	6	ralrimivva 3214	. . . . . 6 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥𝑅𝑦) = 𝑦 ↔ 𝑥 = 0 ))
8		oveq1 7418	. . . . . . . . 9 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑅𝑦) = ((𝐹‘𝑤)𝑅𝑦))
9	8	eqeq1d 2771	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑤) → ((𝑥𝑅𝑦) = 𝑦 ↔ ((𝐹‘𝑤)𝑅𝑦) = 𝑦))
10		eqeq1 2773	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥 = 0 ↔ (𝐹‘𝑤) = 0 ))
11	9, 10	bibi12d 348	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑤) → (((𝑥𝑅𝑦) = 𝑦 ↔ 𝑥 = 0 ) ↔ (((𝐹‘𝑤)𝑅𝑦) = 𝑦 ↔ (𝐹‘𝑤) = 0 )))
12		oveq2 7419	. . . . . . . . 9 ⊢ (𝑦 = (𝐺‘𝑤) → ((𝐹‘𝑤)𝑅𝑦) = ((𝐹‘𝑤)𝑅(𝐺‘𝑤)))
13		id 23	. . . . . . . . 9 ⊢ (𝑦 = (𝐺‘𝑤) → 𝑦 = (𝐺‘𝑤))
14	12, 13	eqeq12d 2785	. . . . . . . 8 ⊢ (𝑦 = (𝐺‘𝑤) → (((𝐹‘𝑤)𝑅𝑦) = 𝑦 ↔ ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = (𝐺‘𝑤)))
15	14	bibi1d 346	. . . . . . 7 ⊢ (𝑦 = (𝐺‘𝑤) → ((((𝐹‘𝑤)𝑅𝑦) = 𝑦 ↔ (𝐹‘𝑤) = 0 ) ↔ (((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = (𝐺‘𝑤) ↔ (𝐹‘𝑤) = 0 )))
16	11, 15	rspc2v 3599	. . . . . 6 ⊢ (((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ((𝑥𝑅𝑦) = 𝑦 ↔ 𝑥 = 0 ) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = (𝐺‘𝑤) ↔ (𝐹‘𝑤) = 0 )))
17	7, 16	mpan9 515	. . . . 5 ⊢ ((𝜑 ∧ ((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆)) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = (𝐺‘𝑤) ↔ (𝐹‘𝑤) = 0 ))
18	5, 17	syldan 602	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = (𝐺‘𝑤) ↔ (𝐹‘𝑤) = 0 ))
19	18	ralbidva 3192	. . 3 ⊢ (𝜑 → (∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = (𝐺‘𝑤) ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤) = 0 ))
20		ovexd 7446	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) ∈ V)
21	20	ralrimiva 3163	. . . 4 ⊢ (𝜑 → ∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) ∈ V)
22		mpteqb 7010	. . . 4 ⊢ (∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) ∈ V → ((𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤))) = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)) ↔ ∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = (𝐺‘𝑤)))
23	21, 22	syl 18	. . 3 ⊢ (𝜑 → ((𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤))) = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)) ↔ ∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = (𝐺‘𝑤)))
24	2	ralrimiva 3163	. . . 4 ⊢ (𝜑 → ∀𝑤 ∈ 𝐴 (𝐹‘𝑤) ∈ 𝑆)
25		mpteqb 7010	. . . 4 ⊢ (∀𝑤 ∈ 𝐴 (𝐹‘𝑤) ∈ 𝑆 → ((𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤)) = (𝑤 ∈ 𝐴 ↦ 0 ) ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤) = 0 ))
26	24, 25	syl 18	. . 3 ⊢ (𝜑 → ((𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤)) = (𝑤 ∈ 𝐴 ↦ 0 ) ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤) = 0 ))
27	19, 23, 26	3bitr4d 314	. 2 ⊢ (𝜑 → ((𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤))) = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)) ↔ (𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤)) = (𝑤 ∈ 𝐴 ↦ 0 )))
28		caofref.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
29	1	feqmptd 6950	. . . 4 ⊢ (𝜑 → 𝐹 = (𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤)))
30	3	feqmptd 6950	. . . 4 ⊢ (𝜑 → 𝐺 = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)))
31	28, 2, 4, 29, 30	offval2 7695	. . 3 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤))))
32	31, 30	eqeq12d 2785	. 2 ⊢ (𝜑 → ((𝐹 ∘f 𝑅𝐺) = 𝐺 ↔ (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤))) = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤))))
33		fconstmpt 5724	. . . 4 ⊢ (𝐴 × { 0 }) = (𝑤 ∈ 𝐴 ↦ 0 )
34	33	a1i 11	. . 3 ⊢ (𝜑 → (𝐴 × { 0 }) = (𝑤 ∈ 𝐴 ↦ 0 ))
35	29, 34	eqeq12d 2785	. 2 ⊢ (𝜑 → (𝐹 = (𝐴 × { 0 }) ↔ (𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤)) = (𝑤 ∈ 𝐴 ↦ 0 )))
36	27, 32, 35	3bitr4d 314	1 ⊢ (𝜑 → ((𝐹 ∘f 𝑅𝐺) = 𝐺 ↔ 𝐹 = (𝐴 × { 0 })))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1567   ∈ wcel 2149  ∀wral 3085  Vcvv 3461  {csn 4592   ↦ cmpt 5194   × cxp 5660  ⟶wf 6533  ‘cfv 6537  (class class class)co 7411   ∘_f cof 7673

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3376  df-rab 3423  df-v 3463  df-sbc 3752  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4491  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-of 7675

This theorem is referenced by:  psdmvr  22301