![]() |
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 4919 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ V → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵}) | |
2 | dfiun2.1 | . . 3 ⊢ 𝐵 ∈ V | |
3 | 2 | a1i 11 | . 2 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ∈ V) |
4 | 1, 3 | mprg 3120 | 1 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 ∈ wcel 2111 {cab 2776 ∃wrex 3107 Vcvv 3441 ∩ cint 4838 ∩ ciin 4882 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-int 4839 df-iin 4884 |
This theorem is referenced by: fniinfv 6717 scott0 9299 cfval2 9671 cflim3 9673 cflim2 9674 cfss 9676 hauscmplem 22011 ptbasfi 22186 dihglblem5 38594 dihglb2 38638 intima0 40348 |
Copyright terms: Public domain | W3C validator |