Theorem caoftrn 7719

Description: Transfer a transitivity law to the function relation. (Contributed by Mario Carneiro, 28-Jul-2014.)

Hypotheses

Ref	Expression
caofref.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
caofref.2	⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
caofcom.3	⊢ (𝜑 → 𝐺:𝐴⟶𝑆)
caofass.4	⊢ (𝜑 → 𝐻:𝐴⟶𝑆)
caoftrn.5	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧))

Assertion

Ref	Expression
caoftrn	⊢ (𝜑 → ((𝐹 ∘r 𝑅𝐺 ∧ 𝐺 ∘r 𝑇𝐻) → 𝐹 ∘r 𝑈𝐻))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐹   𝑥,𝐺,𝑦,𝑧   𝑥,𝐻,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝑅,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑥,𝑇,𝑦,𝑧   𝑥,𝑈,𝑦,𝑧

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

Proof of Theorem caoftrn

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caoftrn.5	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧))
2	1	ralrimivvva 3208	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧))
3	2	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧))
4		caofref.2	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
5	4	ffvelcdmda 7077	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆)
6		caofcom.3	. . . . . 6 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆)
7	6	ffvelcdmda 7077	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆)
8		caofass.4	. . . . . 6 ⊢ (𝜑 → 𝐻:𝐴⟶𝑆)
9	8	ffvelcdmda 7077	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐻‘𝑤) ∈ 𝑆)
10		breq1 5106	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑅𝑦 ↔ (𝐹‘𝑤)𝑅𝑦))
11	10	anbi1d 643	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑤) → ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) ↔ ((𝐹‘𝑤)𝑅𝑦 ∧ 𝑦𝑇𝑧)))
12		breq1 5106	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑈𝑧 ↔ (𝐹‘𝑤)𝑈𝑧))
13	11, 12	imbi12d 347	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧) ↔ (((𝐹‘𝑤)𝑅𝑦 ∧ 𝑦𝑇𝑧) → (𝐹‘𝑤)𝑈𝑧)))
14		breq2 5107	. . . . . . . 8 ⊢ (𝑦 = (𝐺‘𝑤) → ((𝐹‘𝑤)𝑅𝑦 ↔ (𝐹‘𝑤)𝑅(𝐺‘𝑤)))
15		breq1 5106	. . . . . . . 8 ⊢ (𝑦 = (𝐺‘𝑤) → (𝑦𝑇𝑧 ↔ (𝐺‘𝑤)𝑇𝑧))
16	14, 15	anbi12d 644	. . . . . . 7 ⊢ (𝑦 = (𝐺‘𝑤) → (((𝐹‘𝑤)𝑅𝑦 ∧ 𝑦𝑇𝑧) ↔ ((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇𝑧)))
17	16	imbi1d 344	. . . . . 6 ⊢ (𝑦 = (𝐺‘𝑤) → ((((𝐹‘𝑤)𝑅𝑦 ∧ 𝑦𝑇𝑧) → (𝐹‘𝑤)𝑈𝑧) ↔ (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇𝑧) → (𝐹‘𝑤)𝑈𝑧)))
18		breq2 5107	. . . . . . . 8 ⊢ (𝑧 = (𝐻‘𝑤) → ((𝐺‘𝑤)𝑇𝑧 ↔ (𝐺‘𝑤)𝑇(𝐻‘𝑤)))
19	18	anbi2d 642	. . . . . . 7 ⊢ (𝑧 = (𝐻‘𝑤) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇𝑧) ↔ ((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤))))
20		breq2 5107	. . . . . . 7 ⊢ (𝑧 = (𝐻‘𝑤) → ((𝐹‘𝑤)𝑈𝑧 ↔ (𝐹‘𝑤)𝑈(𝐻‘𝑤)))
21	19, 20	imbi12d 347	. . . . . 6 ⊢ (𝑧 = (𝐻‘𝑤) → ((((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇𝑧) → (𝐹‘𝑤)𝑈𝑧) ↔ (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) → (𝐹‘𝑤)𝑈(𝐻‘𝑤))))
22	13, 17, 21	rspc3v 3592	. . . . 5 ⊢ (((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆 ∧ (𝐻‘𝑤) ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) → (𝐹‘𝑤)𝑈(𝐻‘𝑤))))
23	5, 7, 9, 22	syl3anc 1398	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) → (𝐹‘𝑤)𝑈(𝐻‘𝑤))))
24	3, 23	mpd 16	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) → (𝐹‘𝑤)𝑈(𝐻‘𝑤)))
25	24	ralimdva 3174	. 2 ⊢ (𝜑 → (∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) → ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑈(𝐻‘𝑤)))
26	4	ffnd 6703	. . . . 5 ⊢ (𝜑 → 𝐹 Fn 𝐴)
27	6	ffnd 6703	. . . . 5 ⊢ (𝜑 → 𝐺 Fn 𝐴)
28		caofref.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
29		inidm 4172	. . . . 5 ⊢ (𝐴 ∩ 𝐴) = 𝐴
30		eqidd 2761	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) = (𝐹‘𝑤))
31		eqidd 2761	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) = (𝐺‘𝑤))
32	26, 27, 28, 28, 29, 30, 31	ofrfval 7688	. . . 4 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤)))
33	8	ffnd 6703	. . . . 5 ⊢ (𝜑 → 𝐻 Fn 𝐴)
34		eqidd 2761	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐻‘𝑤) = (𝐻‘𝑤))
35	27, 33, 28, 28, 29, 31, 34	ofrfval 7688	. . . 4 ⊢ (𝜑 → (𝐺 ∘r 𝑇𝐻 ↔ ∀𝑤 ∈ 𝐴 (𝐺‘𝑤)𝑇(𝐻‘𝑤)))
36	32, 35	anbi12d 644	. . 3 ⊢ (𝜑 → ((𝐹 ∘r 𝑅𝐺 ∧ 𝐺 ∘r 𝑇𝐻) ↔ (∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ ∀𝑤 ∈ 𝐴 (𝐺‘𝑤)𝑇(𝐻‘𝑤))))
37		r19.26 3122	. . 3 ⊢ (∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) ↔ (∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ ∀𝑤 ∈ 𝐴 (𝐺‘𝑤)𝑇(𝐻‘𝑤)))
38	36, 37	bitr4di 292	. 2 ⊢ (𝜑 → ((𝐹 ∘r 𝑅𝐺 ∧ 𝐺 ∘r 𝑇𝐻) ↔ ∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤))))
39	26, 33, 28, 28, 29, 30, 34	ofrfval 7688	. 2 ⊢ (𝜑 → (𝐹 ∘r 𝑈𝐻 ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑈(𝐻‘𝑤)))
40	25, 38, 39	3imtr4d 297	1 ⊢ (𝜑 → ((𝐹 ∘r 𝑅𝐺 ∧ 𝐺 ∘r 𝑇𝐻) → 𝐹 ∘r 𝑈𝐻))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076   class class class wbr 5103  ⟶wf 6529  ‘cfv 6533   ∘_r cofr 7677

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ofr 7679

This theorem is used by:  gsumbagdiaglem  22146  psdmul  22394  itg2le  25967