Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cotrgOLDOLD | Structured version Visualization version GIF version |
Description: Obsolete version of cotrg 6027 as of 19-Dec-2024. (Contributed by NM, 27-Dec-1996.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) Generalized from its special instance cotr 6030. (Revised by Richard Penner, 24-Dec-2019.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cotrgOLDOLD | ⊢ ((𝐴 ∘ 𝐵) ⊆ 𝐶 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | relco 6026 | . . 3 ⊢ Rel (𝐴 ∘ 𝐵) | |
2 | ssrel 5704 | . . 3 ⊢ (Rel (𝐴 ∘ 𝐵) → ((𝐴 ∘ 𝐵) ⊆ 𝐶 ↔ ∀𝑥∀𝑧(〈𝑥, 𝑧〉 ∈ (𝐴 ∘ 𝐵) → 〈𝑥, 𝑧〉 ∈ 𝐶))) | |
3 | 1, 2 | ax-mp 5 | . 2 ⊢ ((𝐴 ∘ 𝐵) ⊆ 𝐶 ↔ ∀𝑥∀𝑧(〈𝑥, 𝑧〉 ∈ (𝐴 ∘ 𝐵) → 〈𝑥, 𝑧〉 ∈ 𝐶)) |
4 | vex 3441 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
5 | vex 3441 | . . . . . . . 8 ⊢ 𝑧 ∈ V | |
6 | 4, 5 | opelco 5793 | . . . . . . 7 ⊢ (〈𝑥, 𝑧〉 ∈ (𝐴 ∘ 𝐵) ↔ ∃𝑦(𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧)) |
7 | df-br 5082 | . . . . . . . 8 ⊢ (𝑥𝐶𝑧 ↔ 〈𝑥, 𝑧〉 ∈ 𝐶) | |
8 | 7 | bicomi 223 | . . . . . . 7 ⊢ (〈𝑥, 𝑧〉 ∈ 𝐶 ↔ 𝑥𝐶𝑧) |
9 | 6, 8 | imbi12i 351 | . . . . . 6 ⊢ ((〈𝑥, 𝑧〉 ∈ (𝐴 ∘ 𝐵) → 〈𝑥, 𝑧〉 ∈ 𝐶) ↔ (∃𝑦(𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧)) |
10 | 19.23v 1943 | . . . . . 6 ⊢ (∀𝑦((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧) ↔ (∃𝑦(𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧)) | |
11 | 9, 10 | bitr4i 278 | . . . . 5 ⊢ ((〈𝑥, 𝑧〉 ∈ (𝐴 ∘ 𝐵) → 〈𝑥, 𝑧〉 ∈ 𝐶) ↔ ∀𝑦((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧)) |
12 | 11 | albii 1819 | . . . 4 ⊢ (∀𝑧(〈𝑥, 𝑧〉 ∈ (𝐴 ∘ 𝐵) → 〈𝑥, 𝑧〉 ∈ 𝐶) ↔ ∀𝑧∀𝑦((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧)) |
13 | alcom 2154 | . . . 4 ⊢ (∀𝑧∀𝑦((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧) ↔ ∀𝑦∀𝑧((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧)) | |
14 | 12, 13 | bitri 275 | . . 3 ⊢ (∀𝑧(〈𝑥, 𝑧〉 ∈ (𝐴 ∘ 𝐵) → 〈𝑥, 𝑧〉 ∈ 𝐶) ↔ ∀𝑦∀𝑧((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧)) |
15 | 14 | albii 1819 | . 2 ⊢ (∀𝑥∀𝑧(〈𝑥, 𝑧〉 ∈ (𝐴 ∘ 𝐵) → 〈𝑥, 𝑧〉 ∈ 𝐶) ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧)) |
16 | 3, 15 | bitri 275 | 1 ⊢ ((𝐴 ∘ 𝐵) ⊆ 𝐶 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝐵𝑦 ∧ 𝑦𝐴𝑧) → 𝑥𝐶𝑧)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∀wal 1537 ∃wex 1779 ∈ wcel 2104 ⊆ wss 3892 〈cop 4571 class class class wbr 5081 ∘ ccom 5604 Rel wrel 5605 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-11 2152 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pr 5361 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-sb 2066 df-clab 2714 df-cleq 2728 df-clel 2814 df-rab 3306 df-v 3439 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-sn 4566 df-pr 4568 df-op 4572 df-br 5082 df-opab 5144 df-xp 5606 df-rel 5607 df-co 5609 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |