![]() |
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 4168 | . . . . . . 7 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑋 ∈ 𝑉) → 𝑆 ∈ V) | |
2 | 1 | expcom 116 | . . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (𝑆 ⊆ 𝑋 → 𝑆 ∈ V)) |
3 | 2 | ralimdv 2562 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋 → ∀𝑘 ∈ 𝐼 𝑆 ∈ V)) |
4 | 3 | imp 124 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∀𝑘 ∈ 𝐼 𝑆 ∈ V) |
5 | dfiin3g 4920 | . . . 4 ⊢ (∀𝑘 ∈ 𝐼 𝑆 ∈ V → ∩ 𝑘 ∈ 𝐼 𝑆 = ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) | |
6 | 4, 5 | syl 14 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∩ 𝑘 ∈ 𝐼 𝑆 = ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) |
7 | 6 | ineq2d 3360 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = (𝑋 ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
8 | intun 3901 | . . 3 ⊢ ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) = (∩ {𝑋} ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) | |
9 | intsng 3904 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → ∩ {𝑋} = 𝑋) | |
10 | 9 | adantr 276 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∩ {𝑋} = 𝑋) |
11 | 10 | ineq1d 3359 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (∩ {𝑋} ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) = (𝑋 ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
12 | 8, 11 | eqtrid 2238 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) = (𝑋 ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
13 | 7, 12 | eqtr4d 2229 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 ∀wral 2472 Vcvv 2760 ∪ cun 3151 ∩ cin 3152 ⊆ wss 3153 {csn 3618 ∩ cint 3870 ∩ ciin 3913 ↦ cmpt 4090 ran crn 4660 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-v 2762 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-int 3871 df-iin 3915 df-br 4030 df-opab 4091 df-mpt 4092 df-cnv 4667 df-dm 4669 df-rn 4670 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |