Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ssiinf | GIF version |
Description: Subset theorem for an indexed intersection. (Contributed by FL, 15-Oct-2012.) (Proof shortened by Mario Carneiro, 14-Oct-2016.) |
Ref | Expression |
---|---|
ssiinf.1 | ⊢ Ⅎ𝑥𝐶 |
Ref | Expression |
---|---|
ssiinf | ⊢ (𝐶 ⊆ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 2689 | . . . . 5 ⊢ 𝑦 ∈ V | |
2 | eliin 3818 | . . . . 5 ⊢ (𝑦 ∈ V → (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) | |
3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ (𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) |
4 | 3 | ralbii 2441 | . . 3 ⊢ (∀𝑦 ∈ 𝐶 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦 ∈ 𝐶 ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) |
5 | ssiinf.1 | . . . 4 ⊢ Ⅎ𝑥𝐶 | |
6 | nfcv 2281 | . . . 4 ⊢ Ⅎ𝑦𝐴 | |
7 | 5, 6 | ralcomf 2592 | . . 3 ⊢ (∀𝑦 ∈ 𝐶 ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐵 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑦 ∈ 𝐵) |
8 | 4, 7 | bitri 183 | . 2 ⊢ (∀𝑦 ∈ 𝐶 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑦 ∈ 𝐵) |
9 | dfss3 3087 | . 2 ⊢ (𝐶 ⊆ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑦 ∈ 𝐶 𝑦 ∈ ∩ 𝑥 ∈ 𝐴 𝐵) | |
10 | dfss3 3087 | . . 3 ⊢ (𝐶 ⊆ 𝐵 ↔ ∀𝑦 ∈ 𝐶 𝑦 ∈ 𝐵) | |
11 | 10 | ralbii 2441 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐶 𝑦 ∈ 𝐵) |
12 | 8, 9, 11 | 3bitr4i 211 | 1 ⊢ (𝐶 ⊆ ∩ 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 104 ∈ wcel 1480 Ⅎwnfc 2268 ∀wral 2416 Vcvv 2686 ⊆ wss 3071 ∩ ciin 3814 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-v 2688 df-in 3077 df-ss 3084 df-iin 3816 |
This theorem is referenced by: ssiin 3863 dmiin 4785 |
Copyright terms: Public domain | W3C validator |