Theorem caofinvl 7714

Description: Transfer a left inverse law to the function operation. (Contributed by NM, 22-Oct-2014.)

Hypotheses

Ref	Expression
caofref.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
caofref.2	⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
caofinv.3	⊢ (𝜑 → 𝐵 ∈ 𝑊)
caofinv.4	⊢ (𝜑 → 𝑁:𝑆⟶𝑆)
caofinv.5	⊢ (𝜑 → 𝐺 = (𝑣 ∈ 𝐴 ↦ (𝑁‘(𝐹‘𝑣))))
caofinvl.6	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → ((𝑁‘𝑥)𝑅𝑥) = 𝐵)

Assertion

Ref	Expression
caofinvl	⊢ (𝜑 → (𝐺 ∘f 𝑅𝐹) = (𝐴 × {𝐵}))

Distinct variable groups:   𝑥,𝐵   𝑥,𝐹   𝑥,𝐺   𝜑,𝑥   𝑥,𝑅   𝑥,𝑆   𝑣,𝐴   𝑣,𝐹,𝑥   𝑥,𝑁,𝑣   𝑣,𝑆   𝜑,𝑣

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑣)   𝑅(𝑣)   𝐺(𝑣)   𝑉(𝑥, 𝑣)   𝑊(𝑥, 𝑣)

Proof of Theorem caofinvl

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caofref.1	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2		caofinv.5	. . . . . 6 ⊢ (𝜑 → 𝐺 = (𝑣 ∈ 𝐴 ↦ (𝑁‘(𝐹‘𝑣))))
3		caofinv.4	. . . . . . . 8 ⊢ (𝜑 → 𝑁:𝑆⟶𝑆)
4	3	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → 𝑁:𝑆⟶𝑆)
5		caofref.2	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
6	5	ffvelcdmda 7076	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (𝐹‘𝑣) ∈ 𝑆)
7	4, 6	ffvelcdmd 7077	. . . . . 6 ⊢ ((𝜑 ∧ 𝑣 ∈ 𝐴) → (𝑁‘(𝐹‘𝑣)) ∈ 𝑆)
8	2, 7	fmpt3d 7108	. . . . 5 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆)
9	8	ffvelcdmda 7076	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆)
10	5	ffvelcdmda 7076	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆)
11		fvex 6890	. . . . . . 7 ⊢ (𝑁‘(𝐹‘𝑣)) ∈ V
12		eqid 2761	. . . . . . 7 ⊢ (𝑣 ∈ 𝐴 ↦ (𝑁‘(𝐹‘𝑣))) = (𝑣 ∈ 𝐴 ↦ (𝑁‘(𝐹‘𝑣)))
13	11, 12	fnmpti 6674	. . . . . 6 ⊢ (𝑣 ∈ 𝐴 ↦ (𝑁‘(𝐹‘𝑣))) Fn 𝐴
14	2	fneq1d 6624	. . . . . 6 ⊢ (𝜑 → (𝐺 Fn 𝐴 ↔ (𝑣 ∈ 𝐴 ↦ (𝑁‘(𝐹‘𝑣))) Fn 𝐴))
15	13, 14	mpbiri 261	. . . . 5 ⊢ (𝜑 → 𝐺 Fn 𝐴)
16		dffn5 6935	. . . . 5 ⊢ (𝐺 Fn 𝐴 ↔ 𝐺 = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)))
17	15, 16	sylib 221	. . . 4 ⊢ (𝜑 → 𝐺 = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤)))
18	5	feqmptd 6945	. . . 4 ⊢ (𝜑 → 𝐹 = (𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤)))
19	1, 9, 10, 17, 18	offval2 7702	. . 3 ⊢ (𝜑 → (𝐺 ∘f 𝑅𝐹) = (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐹‘𝑤))))
20	2	fveq1d 6879	. . . . . . 7 ⊢ (𝜑 → (𝐺‘𝑤) = ((𝑣 ∈ 𝐴 ↦ (𝑁‘(𝐹‘𝑣)))‘𝑤))
21		2fveq3 6882	. . . . . . . 8 ⊢ (𝑣 = 𝑤 → (𝑁‘(𝐹‘𝑣)) = (𝑁‘(𝐹‘𝑤)))
22		fvex 6890	. . . . . . . 8 ⊢ (𝑁‘(𝐹‘𝑤)) ∈ V
23	21, 12, 22	fvmpt 6985	. . . . . . 7 ⊢ (𝑤 ∈ 𝐴 → ((𝑣 ∈ 𝐴 ↦ (𝑁‘(𝐹‘𝑣)))‘𝑤) = (𝑁‘(𝐹‘𝑤)))
24	20, 23	sylan9eq 2816	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) = (𝑁‘(𝐹‘𝑤)))
25	24	oveq1d 7427	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐺‘𝑤)𝑅(𝐹‘𝑤)) = ((𝑁‘(𝐹‘𝑤))𝑅(𝐹‘𝑤)))
26		fveq2 6877	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑁‘𝑥) = (𝑁‘(𝐹‘𝑤)))
27		id 23	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑤) → 𝑥 = (𝐹‘𝑤))
28	26, 27	oveq12d 7430	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑤) → ((𝑁‘𝑥)𝑅𝑥) = ((𝑁‘(𝐹‘𝑤))𝑅(𝐹‘𝑤)))
29	28	eqeq1d 2763	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (((𝑁‘𝑥)𝑅𝑥) = 𝐵 ↔ ((𝑁‘(𝐹‘𝑤))𝑅(𝐹‘𝑤)) = 𝐵))
30		caofinvl.6	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → ((𝑁‘𝑥)𝑅𝑥) = 𝐵)
31	30	ralrimiva 3155	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ((𝑁‘𝑥)𝑅𝑥) = 𝐵)
32	31	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ∀𝑥 ∈ 𝑆 ((𝑁‘𝑥)𝑅𝑥) = 𝐵)
33	29, 32, 10	rspcdva 3578	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝑁‘(𝐹‘𝑤))𝑅(𝐹‘𝑤)) = 𝐵)
34	25, 33	eqtrd 2796	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐺‘𝑤)𝑅(𝐹‘𝑤)) = 𝐵)
35	34	mpteq2dva 5198	. . 3 ⊢ (𝜑 → (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐹‘𝑤))) = (𝑤 ∈ 𝐴 ↦ 𝐵))
36	19, 35	eqtrd 2796	. 2 ⊢ (𝜑 → (𝐺 ∘f 𝑅𝐹) = (𝑤 ∈ 𝐴 ↦ 𝐵))
37		fconstmpt 5713	. 2 ⊢ (𝐴 × {𝐵}) = (𝑤 ∈ 𝐴 ↦ 𝐵)
38	36, 37	eqtr4di 2814	1 ⊢ (𝜑 → (𝐺 ∘f 𝑅𝐹) = (𝐴 × {𝐵}))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {csn 4584   ↦ cmpt 5186   × cxp 5649   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531  (class class class)co 7412   ∘_f cof 7680

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-of 7682

This theorem is used by:  grpvlinv  22693  lflnegl  40101