| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssbr | Structured version Visualization version GIF version | ||
| Description: Implication from a subclass relationship of binary relations. (Contributed by Peter Mazsa, 11-Nov-2019.) |
| Ref | Expression |
|---|---|
| ssbr | ⊢ (𝐴 ⊆ 𝐵 → (𝐶𝐴𝐷 → 𝐶𝐵𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . 2 ⊢ (𝐴 ⊆ 𝐵 → 𝐴 ⊆ 𝐵) | |
| 2 | 1 | ssbrd 5147 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝐶𝐴𝐷 → 𝐶𝐵𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ⊆ wss 3895 class class class wbr 5102 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1812 df-clel 2835 df-ss 3896 df-br 5103 |
| This theorem is used by: ssbri 5149 coss1 5832 coss2 5833 cnvss 5849 ssrelrn 5875 ttrclss 9721 chnrss 18789 isucn2 24597 brelg 33201 cossss 39448 cocanss2 45922 |
| Copyright terms: Public domain | W3C validator |