Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > riinint | GIF version |
Description: Express a relative indexed intersection as an intersection. (Contributed by Stefan O'Rear, 22-Feb-2015.) |
Ref | Expression |
---|---|
riinint | ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssexg 4115 | . . . . . . 7 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑋 ∈ 𝑉) → 𝑆 ∈ V) | |
2 | 1 | expcom 115 | . . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (𝑆 ⊆ 𝑋 → 𝑆 ∈ V)) |
3 | 2 | ralimdv 2532 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋 → ∀𝑘 ∈ 𝐼 𝑆 ∈ V)) |
4 | 3 | imp 123 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∀𝑘 ∈ 𝐼 𝑆 ∈ V) |
5 | dfiin3g 4856 | . . . 4 ⊢ (∀𝑘 ∈ 𝐼 𝑆 ∈ V → ∩ 𝑘 ∈ 𝐼 𝑆 = ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) | |
6 | 4, 5 | syl 14 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∩ 𝑘 ∈ 𝐼 𝑆 = ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) |
7 | 6 | ineq2d 3318 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = (𝑋 ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
8 | intun 3849 | . . 3 ⊢ ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) = (∩ {𝑋} ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) | |
9 | intsng 3852 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → ∩ {𝑋} = 𝑋) | |
10 | 9 | adantr 274 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∩ {𝑋} = 𝑋) |
11 | 10 | ineq1d 3317 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (∩ {𝑋} ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) = (𝑋 ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
12 | 8, 11 | syl5eq 2209 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) = (𝑋 ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
13 | 7, 12 | eqtr4d 2200 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1342 ∈ wcel 2135 ∀wral 2442 Vcvv 2721 ∪ cun 3109 ∩ cin 3110 ⊆ wss 3111 {csn 3570 ∩ cint 3818 ∩ ciin 3861 ↦ cmpt 4037 ran crn 4599 |
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 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ral 2447 df-rex 2448 df-v 2723 df-un 3115 df-in 3117 df-ss 3124 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-int 3819 df-iin 3863 df-br 3977 df-opab 4038 df-mpt 4039 df-cnv 4606 df-dm 4608 df-rn 4609 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |