![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ineqri | Structured version Visualization version GIF version |
Description: Inference from membership to intersection. (Contributed by NM, 21-Jun-1993.) |
Ref | Expression |
---|---|
ineqri.1 | ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ 𝐶) |
Ref | Expression |
---|---|
ineqri | ⊢ (𝐴 ∩ 𝐵) = 𝐶 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elin 3963 | . . 3 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) | |
2 | ineqri.1 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ 𝐶) | |
3 | 1, 2 | bitri 274 | . 2 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ 𝑥 ∈ 𝐶) |
4 | 3 | eqriv 2723 | 1 ⊢ (𝐴 ∩ 𝐵) = 𝐶 |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 394 = wceq 1534 ∈ wcel 2099 ∩ cin 3946 |
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 2697 |
This theorem depends on definitions: df-bi 206 df-an 395 df-tru 1537 df-ex 1775 df-sb 2061 df-clab 2704 df-cleq 2718 df-clel 2803 df-v 3465 df-in 3954 |
This theorem is referenced by: inidm 4218 inass 4219 dfin2 4260 indi 4273 inab 4299 in0 4390 pwin 5567 dfres3 5985 dmres 6012 inixp 37440 |
Copyright terms: Public domain | W3C validator |