| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfiin2 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of indexed intersection when 𝐵 is a set. Definition 15(b) of [Suppes] p. 44. (Contributed by NM, 28-Jun-1998.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| dfiun2.1 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| dfiin2 | ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfiin2g 4553 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
| 2 | dfiun2.1 | . . 3 ⊢ 𝐵 ∈ V | |
| 3 | 2 | a1i 11 | . 2 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ∈ V) |
| 4 | 1, 3 | mprg 2926 | 1 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1483 ∈ wcel 1990 {cab 2608 ∃wrex 2913 Vcvv 3200 ∩ cint 4475 ∩ ciin 4521 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
| This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-v 3202 df-int 4476 df-iin 4523 |
| This theorem is referenced by: fniinfv 6257 scott0 8749 cfval2 9082 cflim3 9084 cflim2 9085 cfss 9087 hauscmplem 21209 ptbasfi 21384 dihglblem5 36587 dihglb2 36631 intima0 37939 |
| Copyright terms: Public domain | W3C validator |