| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iinss1 | Structured version Visualization version GIF version | ||
| Description: Subclass theorem for indexed intersection. (Contributed by NM, 24-Jan-2012.) |
| Ref | Expression |
|---|---|
| iinss1 | ⊢ (𝐴 ⊆ 𝐵 → ∩ 𝑥 ∈ 𝐵 𝐶 ⊆ ∩ 𝑥 ∈ 𝐴 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssralv 4000 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶 → ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)) | |
| 2 | eliin 4949 | . . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐵 𝐶 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶)) | |
| 3 | 2 | elv 3443 | . . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐵 𝐶 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶) |
| 4 | eliin 4949 | . . . 4 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)) | |
| 5 | 4 | elv 3443 | . . 3 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) |
| 6 | 1, 3, 5 | 3imtr4g 296 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝑦 ∈ ∩ 𝑥 ∈ 𝐵 𝐶 → 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐶)) |
| 7 | 6 | ssrdv 3937 | 1 ⊢ (𝐴 ⊆ 𝐵 → ∩ 𝑥 ∈ 𝐵 𝐶 ⊆ ∩ 𝑥 ∈ 𝐴 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∈ wcel 2113 ∀wral 3049 Vcvv 3438 ⊆ wss 3899 ∩ ciin 4945 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-ral 3050 df-v 3440 df-ss 3916 df-iin 4947 |
| This theorem is referenced by: polcon3N 40116 smflimsuplem5 47010 smflimsuplem7 47012 |
| Copyright terms: Public domain | W3C validator |