Theorem trin2 5021

Description: The intersection of two transitive classes is transitive. (Contributed by FL, 31-Jul-2009.)

Assertion

Ref	Expression
trin2	⊢ (((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ (𝑆 ∘ 𝑆) ⊆ 𝑆) → ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ (𝑅 ∩ 𝑆))

Proof of Theorem trin2

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cotr 5011	. . . 4 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
2		cotr 5011	. . . . . 6 ⊢ ((𝑆 ∘ 𝑆) ⊆ 𝑆 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧))
3		brin 4056	. . . . . . . . . . . . 13 ⊢ (𝑥(𝑅 ∩ 𝑆)𝑦 ↔ (𝑥𝑅𝑦 ∧ 𝑥𝑆𝑦))
4		brin 4056	. . . . . . . . . . . . 13 ⊢ (𝑦(𝑅 ∩ 𝑆)𝑧 ↔ (𝑦𝑅𝑧 ∧ 𝑦𝑆𝑧))
5		simpr 110	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
6		simpl 109	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧))
7	5, 6	anim12d 335	. . . . . . . . . . . . . . 15 ⊢ ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → (((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) ∧ (𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧)) → (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧)))
8	7	com12 30	. . . . . . . . . . . . . 14 ⊢ (((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) ∧ (𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧)) → ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧)))
9	8	an4s 588	. . . . . . . . . . . . 13 ⊢ (((𝑥𝑅𝑦 ∧ 𝑥𝑆𝑦) ∧ (𝑦𝑅𝑧 ∧ 𝑦𝑆𝑧)) → ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧)))
10	3, 4, 9	syl2anb 291	. . . . . . . . . . . 12 ⊢ ((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧)))
11	10	com12 30	. . . . . . . . . . 11 ⊢ ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧)))
12		brin 4056	. . . . . . . . . . 11 ⊢ (𝑥(𝑅 ∩ 𝑆)𝑧 ↔ (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧))
13	11, 12	imbitrrdi 162	. . . . . . . . . 10 ⊢ ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
14	13	alanimi 1459	. . . . . . . . 9 ⊢ ((∀𝑧((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
15	14	alanimi 1459	. . . . . . . 8 ⊢ ((∀𝑦∀𝑧((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
16	15	alanimi 1459	. . . . . . 7 ⊢ ((∀𝑥∀𝑦∀𝑧((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
17	16	ex 115	. . . . . 6 ⊢ (∀𝑥∀𝑦∀𝑧((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) → (∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧) → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧)))
18	2, 17	sylbi 121	. . . . 5 ⊢ ((𝑆 ∘ 𝑆) ⊆ 𝑆 → (∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧) → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧)))
19	18	com12 30	. . . 4 ⊢ (∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧) → ((𝑆 ∘ 𝑆) ⊆ 𝑆 → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧)))
20	1, 19	sylbi 121	. . 3 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 → ((𝑆 ∘ 𝑆) ⊆ 𝑆 → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧)))
21	20	imp 124	. 2 ⊢ (((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ (𝑆 ∘ 𝑆) ⊆ 𝑆) → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
22		cotr 5011	. 2 ⊢ (((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ (𝑅 ∩ 𝑆) ↔ ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
23	21, 22	sylibr 134	1 ⊢ (((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ (𝑆 ∘ 𝑆) ⊆ 𝑆) → ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ (𝑅 ∩ 𝑆))

Syntax hints:   → wi 4   ∧ wa 104  ∀wal 1351   ∩ cin 3129   ⊆ wss 3130   class class class wbr 4004   ∘ ccom 4631

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-pow 4175  ax-pr 4210

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2740  df-un 3134  df-in 3136  df-ss 3143  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-br 4005  df-opab 4066  df-xp 4633  df-rel 4634  df-co 4636

This theorem is referenced by:  trinxp  5023