![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1293 | 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 |
---|---|
bnj1293.1 | ⊢ 𝐴 = (𝐵 ∩ 𝐶) |
Ref | Expression |
---|---|
bnj1293 | ⊢ 𝐴 ⊆ 𝐶 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1293.1 | . 2 ⊢ 𝐴 = (𝐵 ∩ 𝐶) | |
2 | inss2 4230 | . 2 ⊢ (𝐵 ∩ 𝐶) ⊆ 𝐶 | |
3 | 1, 2 | eqsstri 4014 | 1 ⊢ 𝐴 ⊆ 𝐶 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1534 ∩ cin 3946 ⊆ wss 3947 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-ext 2699 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1537 df-ex 1775 df-sb 2061 df-clab 2706 df-cleq 2720 df-clel 2806 df-rab 3430 df-v 3473 df-in 3954 df-ss 3964 |
This theorem is referenced by: bnj1253 34648 bnj1286 34650 bnj1280 34651 bnj1296 34652 |
Copyright terms: Public domain | W3C validator |