![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ssbrd | GIF version |
Description: Deduction from a subclass relationship of binary relations. (Contributed by NM, 30-Apr-2004.) |
Ref | Expression |
---|---|
ssbrd.1 | ⊢ (𝜑 → 𝐴 ⊆ 𝐵) |
Ref | Expression |
---|---|
ssbrd | ⊢ (𝜑 → (𝐶𝐴𝐷 → 𝐶𝐵𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssbrd.1 | . . 3 ⊢ (𝜑 → 𝐴 ⊆ 𝐵) | |
2 | 1 | sseld 3101 | . 2 ⊢ (𝜑 → (〈𝐶, 𝐷〉 ∈ 𝐴 → 〈𝐶, 𝐷〉 ∈ 𝐵)) |
3 | df-br 3938 | . 2 ⊢ (𝐶𝐴𝐷 ↔ 〈𝐶, 𝐷〉 ∈ 𝐴) | |
4 | df-br 3938 | . 2 ⊢ (𝐶𝐵𝐷 ↔ 〈𝐶, 𝐷〉 ∈ 𝐵) | |
5 | 2, 3, 4 | 3imtr4g 204 | 1 ⊢ (𝜑 → (𝐶𝐴𝐷 → 𝐶𝐵𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∈ wcel 1481 ⊆ wss 3076 〈cop 3535 class class class wbr 3937 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-11 1485 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-in 3082 df-ss 3089 df-br 3938 |
This theorem is referenced by: ssbri 3980 sess1 4267 brrelex12 4585 coss1 4702 coss2 4703 eqbrrdva 4717 ersym 6449 ertr 6452 |
Copyright terms: Public domain | W3C validator |