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

Theorem cotrg 6105
Description: Two ways of saying that the composition of two relations is included in a third relation. See its special instance cotr 6106 for the main application. (Contributed by NM, 27-Dec-1996.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) Generalized from its special instance cotr 6106. (Revised by Richard Penner, 24-Dec-2019.) (Proof shortened by SN, 19-Dec-2024.) Avoid ax-11 2194. (Revised by BTernaryTau, 29-Dec-2024.)
Assertion
Ref Expression
cotrg ((𝐴 ∘ 𝐵) ⊆ 𝐶 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧))
Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧

Proof of Theorem cotrg
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 relco 6104 . . 3 Rel (𝐴 ∘ 𝐵)
2 ssrel3 5762 . . 3 (Rel (𝐴 ∘ 𝐵) → ((𝐴 ∘ 𝐵) ⊆ 𝐶 ↔ ∀𝑥∀𝑧(𝑥(𝐴 ∘ 𝐵)𝑧 → 𝑥𝐶𝑧)))
31, 2ax-mp 5 . 2 ((𝐴 ∘ 𝐵) ⊆ 𝐶 ↔ ∀𝑥∀𝑧(𝑥(𝐴 ∘ 𝐵)𝑧 → 𝑥𝐶𝑧))
4 vex 3455 . . . . . . . 8 𝑥 ∈ V
5 vex 3455 . . . . . . . 8 𝑧 ∈ V
64, 5brco 5848 . . . . . . 7 (𝑥(𝐴 ∘ 𝐵)𝑧 ↔ ∃𝑦(𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧))
76imbi1i 352 . . . . . 6 ((𝑥(𝐴 ∘ 𝐵)𝑧 → 𝑥𝐶𝑧) ↔ (∃𝑦(𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧))
8 19.23v 1975 . . . . . 6 (∀𝑦((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧) ↔ (∃𝑦(𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧))
97, 8bitr4i 281 . . . . 5 ((𝑥(𝐴 ∘ 𝐵)𝑧 → 𝑥𝐶𝑧) ↔ ∀𝑦((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧))
109albii 1852 . . . 4 (∀𝑧(𝑥(𝐴 ∘ 𝐵)𝑧 → 𝑥𝐶𝑧) ↔ ∀𝑧∀𝑦((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧))
11 breq2 5107 . . . . . . 7 (𝑧 = 𝑤 → (𝑦𝐴𝑧 ↔ 𝑦𝐴𝑤))
1211anbi2d 642 . . . . . 6 (𝑧 = 𝑤 → ((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) ↔ (𝑥𝐵𝑦 ∧ 𝑦𝐴𝑤)))
13 breq2 5107 . . . . . 6 (𝑧 = 𝑤 → (𝑥𝐶𝑧 ↔ 𝑥𝐶𝑤))
1412, 13imbi12d 347 . . . . 5 (𝑧 = 𝑤 → (((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧) ↔ ((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑤) → 𝑥𝐶𝑤)))
15 breq2 5107 . . . . . . 7 (𝑦 = 𝑤 → (𝑥𝐵𝑦 ↔ 𝑥𝐵𝑤))
16 breq1 5106 . . . . . . 7 (𝑦 = 𝑤 → (𝑦𝐴𝑧 ↔ 𝑤𝐴𝑧))
1715, 16anbi12d 644 . . . . . 6 (𝑦 = 𝑤 → ((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) ↔ (𝑥𝐵𝑤 ∧ 𝑤𝐴𝑧)))
1817imbi1d 344 . . . . 5 (𝑦 = 𝑤 → (((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧) ↔ ((𝑥𝐵𝑤 ∧ 𝑤𝐴𝑧) → 𝑥𝐶𝑧)))
1914, 18alcomw 2078 . . . 4 (∀𝑧∀𝑦((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧) ↔ ∀𝑦∀𝑧((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧))
2010, 19bitri 278 . . 3 (∀𝑧(𝑥(𝐴 ∘ 𝐵)𝑧 → 𝑥𝐶𝑧) ↔ ∀𝑦∀𝑧((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧))
2120albii 1852 . 2 (∀𝑥∀𝑧(𝑥(𝐴 ∘ 𝐵)𝑧 → 𝑥𝐶𝑧) ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧))
223, 21bitri 278 1 ((𝐴 ∘ 𝐵) ⊆ 𝐶 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812   ⊆ wss 3899   class class class wbr 5103   ∘ ccom 5655  Rel wrel 5656
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:  cotr  6106  dffun2  6548  cotr2g  15129
  Copyright terms: Public domain W3C validator