Theorem fvcofneq 6951

Description: The values of two function compositions are equal if the values of the composed functions are pairwise equal. (Contributed by AV, 26-Jan-2019.)

Assertion

Ref	Expression
fvcofneq	⊢ ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → ((𝐹 ∘ 𝐺)‘𝑋) = ((𝐻 ∘ 𝐾)‘𝑋)))

Distinct variable groups:   𝑥,𝐹   𝑥,𝐺   𝑥,𝐻   𝑥,𝐾   𝑥,𝑋

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem fvcofneq

Step	Hyp	Ref	Expression
1		simpl 482	. . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → 𝐺 Fn 𝐴)
2		elinel1 4125	. . . . 5 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) → 𝑋 ∈ 𝐴)
3	2	3ad2ant1 1131	. . . 4 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → 𝑋 ∈ 𝐴)
4		fvco2 6847	. . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
5	1, 3, 4	syl2an 595	. . 3 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
6		simpr 484	. . . . 5 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → 𝐾 Fn 𝐵)
7		elinel2 4126	. . . . . 6 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) → 𝑋 ∈ 𝐵)
8	7	3ad2ant1 1131	. . . . 5 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → 𝑋 ∈ 𝐵)
9		fvco2 6847	. . . . 5 ⊢ ((𝐾 Fn 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝐻 ∘ 𝐾)‘𝑋) = (𝐻‘(𝐾‘𝑋)))
10	6, 8, 9	syl2an 595	. . . 4 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → ((𝐻 ∘ 𝐾)‘𝑋) = (𝐻‘(𝐾‘𝑋)))
11		fveq2 6756	. . . . . . 7 ⊢ ((𝐾‘𝑋) = (𝐺‘𝑋) → (𝐻‘(𝐾‘𝑋)) = (𝐻‘(𝐺‘𝑋)))
12	11	eqcoms 2746	. . . . . 6 ⊢ ((𝐺‘𝑋) = (𝐾‘𝑋) → (𝐻‘(𝐾‘𝑋)) = (𝐻‘(𝐺‘𝑋)))
13	12	3ad2ant2 1132	. . . . 5 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → (𝐻‘(𝐾‘𝑋)) = (𝐻‘(𝐺‘𝑋)))
14	13	adantl 481	. . . 4 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → (𝐻‘(𝐾‘𝑋)) = (𝐻‘(𝐺‘𝑋)))
15		id 22	. . . . . . . . . . . 12 ⊢ (𝐺 Fn 𝐴 → 𝐺 Fn 𝐴)
16		fnfvelrn 6940	. . . . . . . . . . . 12 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐺‘𝑋) ∈ ran 𝐺)
17	15, 2, 16	syl2anr 596	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ 𝐺 Fn 𝐴) → (𝐺‘𝑋) ∈ ran 𝐺)
18	17	ex 412	. . . . . . . . . 10 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) → (𝐺 Fn 𝐴 → (𝐺‘𝑋) ∈ ran 𝐺))
19		id 22	. . . . . . . . . . . 12 ⊢ (𝐾 Fn 𝐵 → 𝐾 Fn 𝐵)
20		fnfvelrn 6940	. . . . . . . . . . . 12 ⊢ ((𝐾 Fn 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝐾‘𝑋) ∈ ran 𝐾)
21	19, 7, 20	syl2anr 596	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ 𝐾 Fn 𝐵) → (𝐾‘𝑋) ∈ ran 𝐾)
22	21	ex 412	. . . . . . . . . 10 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) → (𝐾 Fn 𝐵 → (𝐾‘𝑋) ∈ ran 𝐾))
23	18, 22	anim12d 608	. . . . . . . . 9 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) → ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → ((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐾‘𝑋) ∈ ran 𝐾)))
24		eleq1 2826	. . . . . . . . . . . 12 ⊢ ((𝐾‘𝑋) = (𝐺‘𝑋) → ((𝐾‘𝑋) ∈ ran 𝐾 ↔ (𝐺‘𝑋) ∈ ran 𝐾))
25	24	eqcoms 2746	. . . . . . . . . . 11 ⊢ ((𝐺‘𝑋) = (𝐾‘𝑋) → ((𝐾‘𝑋) ∈ ran 𝐾 ↔ (𝐺‘𝑋) ∈ ran 𝐾))
26	25	anbi2d 628	. . . . . . . . . 10 ⊢ ((𝐺‘𝑋) = (𝐾‘𝑋) → (((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐾‘𝑋) ∈ ran 𝐾) ↔ ((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐺‘𝑋) ∈ ran 𝐾)))
27		elin 3899	. . . . . . . . . . 11 ⊢ ((𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾) ↔ ((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐺‘𝑋) ∈ ran 𝐾))
28	27	biimpri 227	. . . . . . . . . 10 ⊢ (((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐺‘𝑋) ∈ ran 𝐾) → (𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾))
29	26, 28	syl6bi 252	. . . . . . . . 9 ⊢ ((𝐺‘𝑋) = (𝐾‘𝑋) → (((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐾‘𝑋) ∈ ran 𝐾) → (𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾)))
30	23, 29	sylan9 507	. . . . . . . 8 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋)) → ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → (𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾)))
31		fveq2 6756	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐺‘𝑋) → (𝐹‘𝑥) = (𝐹‘(𝐺‘𝑋)))
32		fveq2 6756	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐺‘𝑋) → (𝐻‘𝑥) = (𝐻‘(𝐺‘𝑋)))
33	31, 32	eqeq12d 2754	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐺‘𝑋) → ((𝐹‘𝑥) = (𝐻‘𝑥) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐻‘(𝐺‘𝑋))))
34	33	rspcva 3550	. . . . . . . . . 10 ⊢ (((𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → (𝐹‘(𝐺‘𝑋)) = (𝐻‘(𝐺‘𝑋)))
35	34	eqcomd 2744	. . . . . . . . 9 ⊢ (((𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → (𝐻‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋)))
36	35	ex 412	. . . . . . . 8 ⊢ ((𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾) → (∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥) → (𝐻‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋))))
37	30, 36	syl6 35	. . . . . . 7 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋)) → ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → (∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥) → (𝐻‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋)))))
38	37	com23 86	. . . . . 6 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋)) → (∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥) → ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → (𝐻‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋)))))
39	38	3impia 1115	. . . . 5 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → (𝐻‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋))))
40	39	impcom 407	. . . 4 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → (𝐻‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋)))
41	10, 14, 40	3eqtrrd 2783	. . 3 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → (𝐹‘(𝐺‘𝑋)) = ((𝐻 ∘ 𝐾)‘𝑋))
42	5, 41	eqtrd 2778	. 2 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → ((𝐹 ∘ 𝐺)‘𝑋) = ((𝐻 ∘ 𝐾)‘𝑋))
43	42	ex 412	1 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → ((𝐹 ∘ 𝐺)‘𝑋) = ((𝐻 ∘ 𝐾)‘𝑋)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∀wral 3063   ∩ cin 3882  ran crn 5581   ∘ ccom 5584   Fn wfn 6413  ‘cfv 6418

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-fv 6426

This theorem is referenced by:  fvcosymgeq  18952