| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elinti | Structured version Visualization version GIF version | ||
| Description: Membership in class intersection. (Contributed by NM, 14-Oct-1999.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) |
| Ref | Expression |
|---|---|
| elinti | ⊢ (𝐴 ∈ ∩ 𝐵 → (𝐶 ∈ 𝐵 → 𝐴 ∈ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elintg 4922 | . . 3 ⊢ (𝐴 ∈ ∩ 𝐵 → (𝐴 ∈ ∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝐴 ∈ 𝑥)) | |
| 2 | eleq2 2854 | . . . 4 ⊢ (𝑥 = 𝐶 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝐶)) | |
| 3 | 2 | rspccv 3580 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 𝐴 ∈ 𝑥 → (𝐶 ∈ 𝐵 → 𝐴 ∈ 𝐶)) |
| 4 | 1, 3 | biimtrdi 256 | . 2 ⊢ (𝐴 ∈ ∩ 𝐵 → (𝐴 ∈ ∩ 𝐵 → (𝐶 ∈ 𝐵 → 𝐴 ∈ 𝐶))) |
| 5 | 4 | pm2.43i 53 | 1 ⊢ (𝐴 ∈ ∩ 𝐵 → (𝐶 ∈ 𝐵 → 𝐴 ∈ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2146 ∀wral 3081 ∩ cint 4914 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-int 4915 |
| This theorem is used by: inttsk 10776 subgint 19263 subrngint 20711 subrgint 20746 lssintcl 21137 ufinffr 24139 shintcli 31754 intlidl 33794 insiga 34594 intsal 47104 |
| Copyright terms: Public domain | W3C validator |