| 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 3947 | . . 3 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) | |
| 2 | ineqri.1 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ 𝐶) | |
| 3 | 1, 2 | bitri 275 | . 2 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ 𝑥 ∈ 𝐶) |
| 4 | 3 | eqriv 2733 | 1 ⊢ (𝐴 ∩ 𝐵) = 𝐶 |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∩ cin 3930 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2715 df-cleq 2728 df-clel 2810 df-v 3466 df-in 3938 |
| This theorem is referenced by: inidm 4207 inass 4208 dfin2 4251 indi 4264 inab 4289 in0 4375 pwin 5549 dfres3 5976 dmres 6004 inixp 37757 |
| Copyright terms: Public domain | W3C validator |