| 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 5151 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝐶𝐴𝐷 → 𝐶𝐵𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ⊆ wss 3900 class class class wbr 5106 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-clel 2839 df-ss 3901 df-br 5107 |
| This theorem is used by: ssbri 5153 coss1 5838 coss2 5839 cnvss 5856 ssrelrn 5882 ttrclss 9745 chnrss 18815 isucn2 24624 brelg 33270 cossss 39638 cocanss2 46112 |
| Copyright terms: Public domain | W3C validator |