MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  trin2 Structured version   Visualization version   GIF version

Theorem trin2 6115
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.
StepHypRef Expression
1 cotr 6104 . . . 4 ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
2 cotr 6104 . . . . . 6 ((𝑆 ∘ 𝑆) ⊆ 𝑆 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧))
3 brin 5157 . . . . . . . . . . . . 13 (𝑥(𝑅 ∩ 𝑆)𝑦 ↔ (𝑥𝑅𝑦 ∧ 𝑥𝑆𝑦))
4 brin 5157 . . . . . . . . . . . . 13 (𝑦(𝑅 ∩ 𝑆)𝑧 ↔ (𝑦𝑅𝑧 ∧ 𝑦𝑆𝑧))
5 simpr 490 . . . . . . . . . . . . . . . 16 ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
6 simpl 488 . . . . . . . . . . . . . . . 16 ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧))
75, 6anim12d 621 . . . . . . . . . . . . . . 15 ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → (((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) ∧ (𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧)) → (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧)))
87com12 33 . . . . . . . . . . . . . 14 (((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) ∧ (𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧)) → ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧)))
98an4s 673 . . . . . . . . . . . . 13 (((𝑥𝑅𝑦 ∧ 𝑥𝑆𝑦) ∧ (𝑦𝑅𝑧 ∧ 𝑦𝑆𝑧)) → ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧)))
103, 4, 9syl2anb 610 . . . . . . . . . . . 12 ((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧)))
1110com12 33 . . . . . . . . . . 11 ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧)))
12 brin 5157 . . . . . . . . . . 11 (𝑥(𝑅 ∩ 𝑆)𝑧 ↔ (𝑥𝑅𝑧 ∧ 𝑥𝑆𝑧))
1311, 12imbitrrdi 255 . . . . . . . . . 10 ((((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
1413alanimi 1849 . . . . . . . . 9 ((∀𝑧((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
1514alanimi 1849 . . . . . . . 8 ((∀𝑦∀𝑧((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
1615alanimi 1849 . . . . . . 7 ((∀𝑥∀𝑦∀𝑧((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) ∧ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
1716ex 418 . . . . . 6 (∀𝑥∀𝑦∀𝑧((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧) → (∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧) → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧)))
182, 17sylbi 220 . . . . 5 ((𝑆 ∘ 𝑆) ⊆ 𝑆 → (∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧) → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧)))
1918com12 33 . . . 4 (∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧) → ((𝑆 ∘ 𝑆) ⊆ 𝑆 → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧)))
201, 19sylbi 220 . . 3 ((𝑅 ∘ 𝑅) ⊆ 𝑅 → ((𝑆 ∘ 𝑆) ⊆ 𝑆 → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧)))
2120imp 412 . 2 (((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ (𝑆 ∘ 𝑆) ⊆ 𝑆) → ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
22 cotr 6104 . 2 (((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ (𝑅 ∩ 𝑆) ↔ ∀𝑥∀𝑦∀𝑧((𝑥(𝑅 ∩ 𝑆)𝑦 ∧ 𝑦(𝑅 ∩ 𝑆)𝑧) → 𝑥(𝑅 ∩ 𝑆)𝑧))
2321, 22sylibr 237 1 (((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ (𝑆 ∘ 𝑆) ⊆ 𝑆) → ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ (𝑅 ∩ 𝑆))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   ∩ cin 3898   ⊆ wss 3899   class class class wbr 5103   ∘ ccom 5655
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-ext 2733  ax-sep 5249  ax-pr 5391
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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  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-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-co 5660
This theorem is used by:  trinxp  6117  trficl  44628
  Copyright terms: Public domain W3C validator