Theorem caoftrn 7721

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 3213	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧))
3	2	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧))
4		caofref.2	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
5	4	ffvelcdmda 7083	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆)
6		caofcom.3	. . . . . 6 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆)
7	6	ffvelcdmda 7083	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆)
8		caofass.4	. . . . . 6 ⊢ (𝜑 → 𝐻:𝐴⟶𝑆)
9	8	ffvelcdmda 7083	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐻‘𝑤) ∈ 𝑆)
10		breq1 5114	. . . . . . . 8 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑅𝑦 ↔ (𝐹‘𝑤)𝑅𝑦))
11	10	anbi1d 643	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑤) → ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) ↔ ((𝐹‘𝑤)𝑅𝑦 ∧ 𝑦𝑇𝑧)))
12		breq1 5114	. . . . . . 7 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑈𝑧 ↔ (𝐹‘𝑤)𝑈𝑧))
13	11, 12	imbi12d 347	. . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧) ↔ (((𝐹‘𝑤)𝑅𝑦 ∧ 𝑦𝑇𝑧) → (𝐹‘𝑤)𝑈𝑧)))
14		breq2 5115	. . . . . . . 8 ⊢ (𝑦 = (𝐺‘𝑤) → ((𝐹‘𝑤)𝑅𝑦 ↔ (𝐹‘𝑤)𝑅(𝐺‘𝑤)))
15		breq1 5114	. . . . . . . 8 ⊢ (𝑦 = (𝐺‘𝑤) → (𝑦𝑇𝑧 ↔ (𝐺‘𝑤)𝑇𝑧))
16	14, 15	anbi12d 644	. . . . . . 7 ⊢ (𝑦 = (𝐺‘𝑤) → (((𝐹‘𝑤)𝑅𝑦 ∧ 𝑦𝑇𝑧) ↔ ((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇𝑧)))
17	16	imbi1d 344	. . . . . 6 ⊢ (𝑦 = (𝐺‘𝑤) → ((((𝐹‘𝑤)𝑅𝑦 ∧ 𝑦𝑇𝑧) → (𝐹‘𝑤)𝑈𝑧) ↔ (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇𝑧) → (𝐹‘𝑤)𝑈𝑧)))
18		breq2 5115	. . . . . . . 8 ⊢ (𝑧 = (𝐻‘𝑤) → ((𝐺‘𝑤)𝑇𝑧 ↔ (𝐺‘𝑤)𝑇(𝐻‘𝑤)))
19	18	anbi2d 642	. . . . . . 7 ⊢ (𝑧 = (𝐻‘𝑤) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇𝑧) ↔ ((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤))))
20		breq2 5115	. . . . . . 7 ⊢ (𝑧 = (𝐻‘𝑤) → ((𝐹‘𝑤)𝑈𝑧 ↔ (𝐹‘𝑤)𝑈(𝐻‘𝑤)))
21	19, 20	imbi12d 347	. . . . . 6 ⊢ (𝑧 = (𝐻‘𝑤) → ((((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇𝑧) → (𝐹‘𝑤)𝑈𝑧) ↔ (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) → (𝐹‘𝑤)𝑈(𝐻‘𝑤))))
22	13, 17, 21	rspc3v 3599	. . . . 5 ⊢ (((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆 ∧ (𝐻‘𝑤) ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) → (𝐹‘𝑤)𝑈(𝐻‘𝑤))))
23	5, 7, 9, 22	syl3anc 1398	. . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝑅𝑦 ∧ 𝑦𝑇𝑧) → 𝑥𝑈𝑧) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) → (𝐹‘𝑤)𝑈(𝐻‘𝑤))))
24	3, 23	mpd 16	. . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) → (𝐹‘𝑤)𝑈(𝐻‘𝑤)))
25	24	ralimdva 3179	. 2 ⊢ (𝜑 → (∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) → ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑈(𝐻‘𝑤)))
26	4	ffnd 6710	. . . . 5 ⊢ (𝜑 → 𝐹 Fn 𝐴)
27	6	ffnd 6710	. . . . 5 ⊢ (𝜑 → 𝐺 Fn 𝐴)
28		caofref.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
29		inidm 4179	. . . . 5 ⊢ (𝐴 ∩ 𝐴) = 𝐴
30		eqidd 2766	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) = (𝐹‘𝑤))
31		eqidd 2766	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) = (𝐺‘𝑤))
32	26, 27, 28, 28, 29, 30, 31	ofrfval 7690	. . . 4 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤)))
33	8	ffnd 6710	. . . . 5 ⊢ (𝜑 → 𝐻 Fn 𝐴)
34		eqidd 2766	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐻‘𝑤) = (𝐻‘𝑤))
35	27, 33, 28, 28, 29, 31, 34	ofrfval 7690	. . . 4 ⊢ (𝜑 → (𝐺 ∘r 𝑇𝐻 ↔ ∀𝑤 ∈ 𝐴 (𝐺‘𝑤)𝑇(𝐻‘𝑤)))
36	32, 35	anbi12d 644	. . 3 ⊢ (𝜑 → ((𝐹 ∘r 𝑅𝐺 ∧ 𝐺 ∘r 𝑇𝐻) ↔ (∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ ∀𝑤 ∈ 𝐴 (𝐺‘𝑤)𝑇(𝐻‘𝑤))))
37		r19.26 3127	. . 3 ⊢ (∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤)) ↔ (∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ ∀𝑤 ∈ 𝐴 (𝐺‘𝑤)𝑇(𝐻‘𝑤)))
38	36, 37	bitr4di 292	. 2 ⊢ (𝜑 → ((𝐹 ∘r 𝑅𝐺 ∧ 𝐺 ∘r 𝑇𝐻) ↔ ∀𝑤 ∈ 𝐴 ((𝐹‘𝑤)𝑅(𝐺‘𝑤) ∧ (𝐺‘𝑤)𝑇(𝐻‘𝑤))))
39	26, 33, 28, 28, 29, 30, 34	ofrfval 7690	. 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 2146  ∀wral 3081   class class class wbr 5111  ⟶wf 6536  ‘cfv 6540   ∘_r cofr 7679

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ofr 7681

This theorem is used by:  gsumbagdiaglem  22111  psdmul  22359  itg2le  25929