Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1262 | Structured version Visualization version GIF version |
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
Ref | Expression |
---|---|
bnj1262.1 | ⊢ 𝐴 ⊆ 𝐵 |
bnj1262.2 | ⊢ (𝜑 → 𝐶 = 𝐴) |
Ref | Expression |
---|---|
bnj1262 | ⊢ (𝜑 → 𝐶 ⊆ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1262.2 | . 2 ⊢ (𝜑 → 𝐶 = 𝐴) | |
2 | bnj1262.1 | . 2 ⊢ 𝐴 ⊆ 𝐵 | |
3 | 1, 2 | eqsstrdi 4018 | 1 ⊢ (𝜑 → 𝐶 ⊆ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1528 ⊆ wss 3933 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-in 3940 df-ss 3949 |
This theorem is referenced by: bnj229 32055 bnj1128 32159 bnj1145 32162 |
Copyright terms: Public domain | W3C validator |