Theorem afvco2 47170

Description: Value of a function composition, analogous to fvco2 6940. (Contributed by Alexander van der Vekens, 23-Jul-2017.)

Assertion

Ref	Expression
afvco2	⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)'''𝑋) = (𝐹'''(𝐺'''𝑋)))

Proof of Theorem afvco2

Step	Hyp	Ref	Expression
1		fvco2 6940	. . . . 5 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
2	1	adantl 481	. . . 4 ⊢ ((((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
3		simpll 766	. . . . . 6 ⊢ ((((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → (𝐺‘𝑋) ∈ dom 𝐹)
4		df-fn 6502	. . . . . . . . 9 ⊢ (𝐺 Fn 𝐴 ↔ (Fun 𝐺 ∧ dom 𝐺 = 𝐴))
5		simpll 766	. . . . . . . . . 10 ⊢ (((Fun 𝐺 ∧ dom 𝐺 = 𝐴) ∧ 𝑋 ∈ 𝐴) → Fun 𝐺)
6		eleq2 2817	. . . . . . . . . . . . . 14 ⊢ (𝐴 = dom 𝐺 → (𝑋 ∈ 𝐴 ↔ 𝑋 ∈ dom 𝐺))
7	6	eqcoms 2737	. . . . . . . . . . . . 13 ⊢ (dom 𝐺 = 𝐴 → (𝑋 ∈ 𝐴 ↔ 𝑋 ∈ dom 𝐺))
8	7	biimpd 229	. . . . . . . . . . . 12 ⊢ (dom 𝐺 = 𝐴 → (𝑋 ∈ 𝐴 → 𝑋 ∈ dom 𝐺))
9	8	adantl 481	. . . . . . . . . . 11 ⊢ ((Fun 𝐺 ∧ dom 𝐺 = 𝐴) → (𝑋 ∈ 𝐴 → 𝑋 ∈ dom 𝐺))
10	9	imp 406	. . . . . . . . . 10 ⊢ (((Fun 𝐺 ∧ dom 𝐺 = 𝐴) ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ dom 𝐺)
11	5, 10	jca 511	. . . . . . . . 9 ⊢ (((Fun 𝐺 ∧ dom 𝐺 = 𝐴) ∧ 𝑋 ∈ 𝐴) → (Fun 𝐺 ∧ 𝑋 ∈ dom 𝐺))
12	4, 11	sylanb 581	. . . . . . . 8 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (Fun 𝐺 ∧ 𝑋 ∈ dom 𝐺))
13	12	adantl 481	. . . . . . 7 ⊢ ((((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → (Fun 𝐺 ∧ 𝑋 ∈ dom 𝐺))
14		dmfco 6939	. . . . . . 7 ⊢ ((Fun 𝐺 ∧ 𝑋 ∈ dom 𝐺) → (𝑋 ∈ dom (𝐹 ∘ 𝐺) ↔ (𝐺‘𝑋) ∈ dom 𝐹))
15	13, 14	syl 17	. . . . . 6 ⊢ ((((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → (𝑋 ∈ dom (𝐹 ∘ 𝐺) ↔ (𝐺‘𝑋) ∈ dom 𝐹))
16	3, 15	mpbird 257	. . . . 5 ⊢ ((((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → 𝑋 ∈ dom (𝐹 ∘ 𝐺))
17		funcoressn 47036	. . . . 5 ⊢ ((((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → Fun ((𝐹 ∘ 𝐺) ↾ {𝑋}))
18		df-dfat 47113	. . . . . 6 ⊢ ((𝐹 ∘ 𝐺) defAt 𝑋 ↔ (𝑋 ∈ dom (𝐹 ∘ 𝐺) ∧ Fun ((𝐹 ∘ 𝐺) ↾ {𝑋})))
19		afvfundmfveq 47132	. . . . . 6 ⊢ ((𝐹 ∘ 𝐺) defAt 𝑋 → ((𝐹 ∘ 𝐺)'''𝑋) = ((𝐹 ∘ 𝐺)‘𝑋))
20	18, 19	sylbir 235	. . . . 5 ⊢ ((𝑋 ∈ dom (𝐹 ∘ 𝐺) ∧ Fun ((𝐹 ∘ 𝐺) ↾ {𝑋})) → ((𝐹 ∘ 𝐺)'''𝑋) = ((𝐹 ∘ 𝐺)‘𝑋))
21	16, 17, 20	syl2anc 584	. . . 4 ⊢ ((((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → ((𝐹 ∘ 𝐺)'''𝑋) = ((𝐹 ∘ 𝐺)‘𝑋))
22		df-dfat 47113	. . . . . 6 ⊢ (𝐹 defAt (𝐺‘𝑋) ↔ ((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})))
23		afvfundmfveq 47132	. . . . . 6 ⊢ (𝐹 defAt (𝐺‘𝑋) → (𝐹'''(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋)))
24	22, 23	sylbir 235	. . . . 5 ⊢ (((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) → (𝐹'''(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋)))
25	24	adantr 480	. . . 4 ⊢ ((((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → (𝐹'''(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑋)))
26	2, 21, 25	3eqtr4d 2774	. . 3 ⊢ ((((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → ((𝐹 ∘ 𝐺)'''𝑋) = (𝐹'''(𝐺‘𝑋)))
27		ianor 983	. . . . . 6 ⊢ (¬ ((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ↔ (¬ (𝐺‘𝑋) ∈ dom 𝐹 ∨ ¬ Fun (𝐹 ↾ {(𝐺‘𝑋)})))
28	14	funfni 6606	. . . . . . . . . . 11 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑋 ∈ dom (𝐹 ∘ 𝐺) ↔ (𝐺‘𝑋) ∈ dom 𝐹))
29	28	bicomd 223	. . . . . . . . . 10 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐺‘𝑋) ∈ dom 𝐹 ↔ 𝑋 ∈ dom (𝐹 ∘ 𝐺)))
30	29	notbid 318	. . . . . . . . 9 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (¬ (𝐺‘𝑋) ∈ dom 𝐹 ↔ ¬ 𝑋 ∈ dom (𝐹 ∘ 𝐺)))
31	30	biimpd 229	. . . . . . . 8 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (¬ (𝐺‘𝑋) ∈ dom 𝐹 → ¬ 𝑋 ∈ dom (𝐹 ∘ 𝐺)))
32		ndmafv 47134	. . . . . . . 8 ⊢ (¬ 𝑋 ∈ dom (𝐹 ∘ 𝐺) → ((𝐹 ∘ 𝐺)'''𝑋) = V)
33	31, 32	syl6com 37	. . . . . . 7 ⊢ (¬ (𝐺‘𝑋) ∈ dom 𝐹 → ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)'''𝑋) = V))
34		funressnfv 47037	. . . . . . . . . . . 12 ⊢ (((𝑋 ∈ dom (𝐹 ∘ 𝐺) ∧ Fun ((𝐹 ∘ 𝐺) ↾ {𝑋})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → Fun (𝐹 ↾ {(𝐺‘𝑋)}))
35	34	ex 412	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ dom (𝐹 ∘ 𝐺) ∧ Fun ((𝐹 ∘ 𝐺) ↾ {𝑋})) → ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → Fun (𝐹 ↾ {(𝐺‘𝑋)})))
36		afvnfundmuv 47133	. . . . . . . . . . . 12 ⊢ (¬ (𝐹 ∘ 𝐺) defAt 𝑋 → ((𝐹 ∘ 𝐺)'''𝑋) = V)
37	18, 36	sylnbir 331	. . . . . . . . . . 11 ⊢ (¬ (𝑋 ∈ dom (𝐹 ∘ 𝐺) ∧ Fun ((𝐹 ∘ 𝐺) ↾ {𝑋})) → ((𝐹 ∘ 𝐺)'''𝑋) = V)
38	35, 37	nsyl4 158	. . . . . . . . . 10 ⊢ (¬ ((𝐹 ∘ 𝐺)'''𝑋) = V → ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → Fun (𝐹 ↾ {(𝐺‘𝑋)})))
39	38	com12 32	. . . . . . . . 9 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (¬ ((𝐹 ∘ 𝐺)'''𝑋) = V → Fun (𝐹 ↾ {(𝐺‘𝑋)})))
40	39	con1d 145	. . . . . . . 8 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (¬ Fun (𝐹 ↾ {(𝐺‘𝑋)}) → ((𝐹 ∘ 𝐺)'''𝑋) = V))
41	40	com12 32	. . . . . . 7 ⊢ (¬ Fun (𝐹 ↾ {(𝐺‘𝑋)}) → ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)'''𝑋) = V))
42	33, 41	jaoi 857	. . . . . 6 ⊢ ((¬ (𝐺‘𝑋) ∈ dom 𝐹 ∨ ¬ Fun (𝐹 ↾ {(𝐺‘𝑋)})) → ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)'''𝑋) = V))
43	27, 42	sylbi 217	. . . . 5 ⊢ (¬ ((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) → ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)'''𝑋) = V))
44	43	imp 406	. . . 4 ⊢ ((¬ ((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → ((𝐹 ∘ 𝐺)'''𝑋) = V)
45		afvnfundmuv 47133	. . . . . . 7 ⊢ (¬ 𝐹 defAt (𝐺‘𝑋) → (𝐹'''(𝐺‘𝑋)) = V)
46	22, 45	sylnbir 331	. . . . . 6 ⊢ (¬ ((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) → (𝐹'''(𝐺‘𝑋)) = V)
47	46	eqcomd 2735	. . . . 5 ⊢ (¬ ((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) → V = (𝐹'''(𝐺‘𝑋)))
48	47	adantr 480	. . . 4 ⊢ ((¬ ((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → V = (𝐹'''(𝐺‘𝑋)))
49	44, 48	eqtrd 2764	. . 3 ⊢ ((¬ ((𝐺‘𝑋) ∈ dom 𝐹 ∧ Fun (𝐹 ↾ {(𝐺‘𝑋)})) ∧ (𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴)) → ((𝐹 ∘ 𝐺)'''𝑋) = (𝐹'''(𝐺‘𝑋)))
50	26, 49	pm2.61ian 811	. 2 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)'''𝑋) = (𝐹'''(𝐺‘𝑋)))
51		eqidd 2730	. . 3 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝐹 = 𝐹)
52	4, 9	sylbi 217	. . . . . 6 ⊢ (𝐺 Fn 𝐴 → (𝑋 ∈ 𝐴 → 𝑋 ∈ dom 𝐺))
53	52	imp 406	. . . . 5 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → 𝑋 ∈ dom 𝐺)
54		fnfun 6600	. . . . . . 7 ⊢ (𝐺 Fn 𝐴 → Fun 𝐺)
55	54	funresd 6543	. . . . . 6 ⊢ (𝐺 Fn 𝐴 → Fun (𝐺 ↾ {𝑋}))
56	55	adantr 480	. . . . 5 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → Fun (𝐺 ↾ {𝑋}))
57		df-dfat 47113	. . . . . 6 ⊢ (𝐺 defAt 𝑋 ↔ (𝑋 ∈ dom 𝐺 ∧ Fun (𝐺 ↾ {𝑋})))
58		afvfundmfveq 47132	. . . . . 6 ⊢ (𝐺 defAt 𝑋 → (𝐺'''𝑋) = (𝐺‘𝑋))
59	57, 58	sylbir 235	. . . . 5 ⊢ ((𝑋 ∈ dom 𝐺 ∧ Fun (𝐺 ↾ {𝑋})) → (𝐺'''𝑋) = (𝐺‘𝑋))
60	53, 56, 59	syl2anc 584	. . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐺'''𝑋) = (𝐺‘𝑋))
61	60	eqcomd 2735	. . 3 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐺‘𝑋) = (𝐺'''𝑋))
62	51, 61	afveq12d 47127	. 2 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹'''(𝐺‘𝑋)) = (𝐹'''(𝐺'''𝑋)))
63	50, 62	eqtrd 2764	1 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)'''𝑋) = (𝐹'''(𝐺'''𝑋)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1540   ∈ wcel 2109  Vcvv 3444  {csn 4585  dom cdm 5631   ↾ cres 5633   ∘ ccom 5635  Fun wfun 6493   Fn wfn 6494  ‘cfv 6499   defAt wdfat 47110  '''cafv 47111

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pr 5382

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-br 5103  df-opab 5165  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-fv 6507  df-aiota 47079  df-dfat 47113  df-afv 47114

This theorem is referenced by: (None)