![]() |
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 3178 | . 2 ⊢ (𝜑 → (〈𝐶, 𝐷〉 ∈ 𝐴 → 〈𝐶, 𝐷〉 ∈ 𝐵)) |
3 | df-br 4030 | . 2 ⊢ (𝐶𝐴𝐷 ↔ 〈𝐶, 𝐷〉 ∈ 𝐴) | |
4 | df-br 4030 | . 2 ⊢ (𝐶𝐵𝐷 ↔ 〈𝐶, 𝐷〉 ∈ 𝐵) | |
5 | 2, 3, 4 | 3imtr4g 205 | 1 ⊢ (𝜑 → (𝐶𝐴𝐷 → 𝐶𝐵𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∈ wcel 2164 ⊆ wss 3153 〈cop 3621 class class class wbr 4029 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-11 1517 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2175 |
This theorem depends on definitions: df-bi 117 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-in 3159 df-ss 3166 df-br 4030 |
This theorem is referenced by: ssbri 4073 sess1 4368 brrelex12 4697 coss1 4817 coss2 4818 eqbrrdva 4832 ersym 6599 ertr 6602 subrguss 13732 znleval 14141 |
Copyright terms: Public domain | W3C validator |