Theorem fvcofneq 6853

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 485	. . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → 𝐺 Fn 𝐴)
2		elinel1 4171	. . . . 5 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) → 𝑋 ∈ 𝐴)
3	2	3ad2ant1 1129	. . . 4 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → 𝑋 ∈ 𝐴)
4		fvco2 6752	. . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
5	1, 3, 4	syl2an 597	. . 3 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
6		simpr 487	. . . . 5 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → 𝐾 Fn 𝐵)
7		elinel2 4172	. . . . . 6 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) → 𝑋 ∈ 𝐵)
8	7	3ad2ant1 1129	. . . . 5 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → 𝑋 ∈ 𝐵)
9		fvco2 6752	. . . . 5 ⊢ ((𝐾 Fn 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝐻 ∘ 𝐾)‘𝑋) = (𝐻‘(𝐾‘𝑋)))
10	6, 8, 9	syl2an 597	. . . 4 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → ((𝐻 ∘ 𝐾)‘𝑋) = (𝐻‘(𝐾‘𝑋)))
11		fveq2 6664	. . . . . . 7 ⊢ ((𝐾‘𝑋) = (𝐺‘𝑋) → (𝐻‘(𝐾‘𝑋)) = (𝐻‘(𝐺‘𝑋)))
12	11	eqcoms 2829	. . . . . 6 ⊢ ((𝐺‘𝑋) = (𝐾‘𝑋) → (𝐻‘(𝐾‘𝑋)) = (𝐻‘(𝐺‘𝑋)))
13	12	3ad2ant2 1130	. . . . 5 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → (𝐻‘(𝐾‘𝑋)) = (𝐻‘(𝐺‘𝑋)))
14	13	adantl 484	. . . 4 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → (𝐻‘(𝐾‘𝑋)) = (𝐻‘(𝐺‘𝑋)))
15		id 22	. . . . . . . . . . . 12 ⊢ (𝐺 Fn 𝐴 → 𝐺 Fn 𝐴)
16		fnfvelrn 6842	. . . . . . . . . . . 12 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐺‘𝑋) ∈ ran 𝐺)
17	15, 2, 16	syl2anr 598	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ 𝐺 Fn 𝐴) → (𝐺‘𝑋) ∈ ran 𝐺)
18	17	ex 415	. . . . . . . . . 10 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) → (𝐺 Fn 𝐴 → (𝐺‘𝑋) ∈ ran 𝐺))
19		id 22	. . . . . . . . . . . 12 ⊢ (𝐾 Fn 𝐵 → 𝐾 Fn 𝐵)
20		fnfvelrn 6842	. . . . . . . . . . . 12 ⊢ ((𝐾 Fn 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝐾‘𝑋) ∈ ran 𝐾)
21	19, 7, 20	syl2anr 598	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ 𝐾 Fn 𝐵) → (𝐾‘𝑋) ∈ ran 𝐾)
22	21	ex 415	. . . . . . . . . 10 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) → (𝐾 Fn 𝐵 → (𝐾‘𝑋) ∈ ran 𝐾))
23	18, 22	anim12d 610	. . . . . . . . 9 ⊢ (𝑋 ∈ (𝐴 ∩ 𝐵) → ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → ((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐾‘𝑋) ∈ ran 𝐾)))
24		eleq1 2900	. . . . . . . . . . . 12 ⊢ ((𝐾‘𝑋) = (𝐺‘𝑋) → ((𝐾‘𝑋) ∈ ran 𝐾 ↔ (𝐺‘𝑋) ∈ ran 𝐾))
25	24	eqcoms 2829	. . . . . . . . . . 11 ⊢ ((𝐺‘𝑋) = (𝐾‘𝑋) → ((𝐾‘𝑋) ∈ ran 𝐾 ↔ (𝐺‘𝑋) ∈ ran 𝐾))
26	25	anbi2d 630	. . . . . . . . . 10 ⊢ ((𝐺‘𝑋) = (𝐾‘𝑋) → (((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐾‘𝑋) ∈ ran 𝐾) ↔ ((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐺‘𝑋) ∈ ran 𝐾)))
27		elin 4168	. . . . . . . . . . 11 ⊢ ((𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾) ↔ ((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐺‘𝑋) ∈ ran 𝐾))
28	27	biimpri 230	. . . . . . . . . 10 ⊢ (((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐺‘𝑋) ∈ ran 𝐾) → (𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾))
29	26, 28	syl6bi 255	. . . . . . . . 9 ⊢ ((𝐺‘𝑋) = (𝐾‘𝑋) → (((𝐺‘𝑋) ∈ ran 𝐺 ∧ (𝐾‘𝑋) ∈ ran 𝐾) → (𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾)))
30	23, 29	sylan9 510	. . . . . . . 8 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋)) → ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → (𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾)))
31		fveq2 6664	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐺‘𝑋) → (𝐹‘𝑥) = (𝐹‘(𝐺‘𝑋)))
32		fveq2 6664	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝐺‘𝑋) → (𝐻‘𝑥) = (𝐻‘(𝐺‘𝑋)))
33	31, 32	eqeq12d 2837	. . . . . . . . . . 11 ⊢ (𝑥 = (𝐺‘𝑋) → ((𝐹‘𝑥) = (𝐻‘𝑥) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐻‘(𝐺‘𝑋))))
34	33	rspcva 3620	. . . . . . . . . 10 ⊢ (((𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → (𝐹‘(𝐺‘𝑋)) = (𝐻‘(𝐺‘𝑋)))
35	34	eqcomd 2827	. . . . . . . . 9 ⊢ (((𝐺‘𝑋) ∈ (ran 𝐺 ∩ ran 𝐾) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → (𝐻‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋)))
36	35	ex 415	. . . . . . . 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 1113	. . . . 5 ⊢ ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → (𝐻‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋))))
40	39	impcom 410	. . . 4 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → (𝐻‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋)))
41	10, 14, 40	3eqtrrd 2861	. . 3 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → (𝐹‘(𝐺‘𝑋)) = ((𝐻 ∘ 𝐾)‘𝑋))
42	5, 41	eqtrd 2856	. 2 ⊢ (((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) ∧ (𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥))) → ((𝐹 ∘ 𝐺)‘𝑋) = ((𝐻 ∘ 𝐾)‘𝑋))
43	42	ex 415	1 ⊢ ((𝐺 Fn 𝐴 ∧ 𝐾 Fn 𝐵) → ((𝑋 ∈ (𝐴 ∩ 𝐵) ∧ (𝐺‘𝑋) = (𝐾‘𝑋) ∧ ∀𝑥 ∈ (ran 𝐺 ∩ ran 𝐾)(𝐹‘𝑥) = (𝐻‘𝑥)) → ((𝐹 ∘ 𝐺)‘𝑋) = ((𝐻 ∘ 𝐾)‘𝑋)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110  ∀wral 3138   ∩ cin 3934  ran crn 5550   ∘ ccom 5553   Fn wfn 6344  ‘cfv 6349

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 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-iota 6308  df-fun 6351  df-fn 6352  df-fv 6357

This theorem is referenced by:  fvcosymgeq  18551