| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfiin3 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of indexed intersection when 𝐵 is a set. (Contributed by Mario Carneiro, 31-Aug-2015.) |
| Ref | Expression |
|---|---|
| dfiun3.1 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| dfiin3 | ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfiin3g 5922 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
| 2 | dfiun3.1 | . . 3 ⊢ 𝐵 ∈ V | |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ∈ V) |
| 4 | 1, 3 | mprg 3058 | 1 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 Vcvv 3430 ∩ cint 4890 ∩ ciin 4935 ↦ cmpt 5167 ran crn 5629 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-pr 5374 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-int 4891 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-cnv 5636 df-dm 5638 df-rn 5639 |
| This theorem is referenced by: subdrgint 20777 fclscmpi 24010 |
| Copyright terms: Public domain | W3C validator |