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 3896 | . . . . . . 7 ⊢ ((𝑆 ⊆ 𝑋 ∧ 𝑋 ∈ 𝑉) → 𝑆 ∈ V) | |
2 | 1 | expcom 109 | . . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (𝑆 ⊆ 𝑋 → 𝑆 ∈ V)) |
3 | 2 | ralimdv 2388 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → (∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋 → ∀𝑘 ∈ 𝐼 𝑆 ∈ V)) |
4 | 3 | imp 115 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∀𝑘 ∈ 𝐼 𝑆 ∈ V) |
5 | dfiin3g 4590 | . . . 4 ⊢ (∀𝑘 ∈ 𝐼 𝑆 ∈ V → ∩ 𝑘 ∈ 𝐼 𝑆 = ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) | |
6 | 4, 5 | syl 14 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∩ 𝑘 ∈ 𝐼 𝑆 = ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) |
7 | 6 | ineq2d 3138 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = (𝑋 ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
8 | intun 3646 | . . 3 ⊢ ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) = (∩ {𝑋} ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) | |
9 | intsng 3649 | . . . . 5 ⊢ (𝑋 ∈ 𝑉 → ∩ {𝑋} = 𝑋) | |
10 | 9 | adantr 261 | . . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∩ {𝑋} = 𝑋) |
11 | 10 | ineq1d 3137 | . . 3 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (∩ {𝑋} ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) = (𝑋 ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
12 | 8, 11 | syl5eq 2084 | . 2 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆)) = (𝑋 ∩ ∩ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
13 | 7, 12 | eqtr4d 2075 | 1 ⊢ ((𝑋 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐼 𝑆 ⊆ 𝑋) → (𝑋 ∩ ∩ 𝑘 ∈ 𝐼 𝑆) = ∩ ({𝑋} ∪ ran (𝑘 ∈ 𝐼 ↦ 𝑆))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 = wceq 1243 ∈ wcel 1393 ∀wral 2306 Vcvv 2557 ∪ cun 2915 ∩ cin 2916 ⊆ wss 2917 {csn 3375 ∩ cint 3615 ∩ ciin 3658 ↦ cmpt 3818 ran crn 4346 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-int 3616 df-iin 3660 df-br 3765 df-opab 3819 df-mpt 3820 df-cnv 4353 df-dm 4355 df-rn 4356 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |