Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fival | Structured version Visualization version GIF version |
Description: The set of all the finite intersections of the elements of 𝐴. (Contributed by FL, 27-Apr-2008.) (Revised by Mario Carneiro, 24-Nov-2013.) |
Ref | Expression |
---|---|
fival | ⊢ (𝐴 ∈ 𝑉 → (fi‘𝐴) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = ∩ 𝑥}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-fi 8875 | . 2 ⊢ fi = (𝑧 ∈ V ↦ {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = ∩ 𝑥}) | |
2 | pweq 4555 | . . . . 5 ⊢ (𝑧 = 𝐴 → 𝒫 𝑧 = 𝒫 𝐴) | |
3 | 2 | ineq1d 4188 | . . . 4 ⊢ (𝑧 = 𝐴 → (𝒫 𝑧 ∩ Fin) = (𝒫 𝐴 ∩ Fin)) |
4 | 3 | rexeqdv 3416 | . . 3 ⊢ (𝑧 = 𝐴 → (∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = ∩ 𝑥 ↔ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = ∩ 𝑥)) |
5 | 4 | abbidv 2885 | . 2 ⊢ (𝑧 = 𝐴 → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝑧 ∩ Fin)𝑦 = ∩ 𝑥} = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = ∩ 𝑥}) |
6 | elex 3512 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
7 | simpr 487 | . . . . . . 7 ⊢ ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = ∩ 𝑥) → 𝑦 = ∩ 𝑥) | |
8 | elinel1 4172 | . . . . . . . . 9 ⊢ (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥 ∈ 𝒫 𝐴) | |
9 | 8 | elpwid 4550 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝒫 𝐴 ∩ Fin) → 𝑥 ⊆ 𝐴) |
10 | eqvisset 3511 | . . . . . . . . 9 ⊢ (𝑦 = ∩ 𝑥 → ∩ 𝑥 ∈ V) | |
11 | intex 5240 | . . . . . . . . 9 ⊢ (𝑥 ≠ ∅ ↔ ∩ 𝑥 ∈ V) | |
12 | 10, 11 | sylibr 236 | . . . . . . . 8 ⊢ (𝑦 = ∩ 𝑥 → 𝑥 ≠ ∅) |
13 | intssuni2 4901 | . . . . . . . 8 ⊢ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) → ∩ 𝑥 ⊆ ∪ 𝐴) | |
14 | 9, 12, 13 | syl2an 597 | . . . . . . 7 ⊢ ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = ∩ 𝑥) → ∩ 𝑥 ⊆ ∪ 𝐴) |
15 | 7, 14 | eqsstrd 4005 | . . . . . 6 ⊢ ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = ∩ 𝑥) → 𝑦 ⊆ ∪ 𝐴) |
16 | velpw 4544 | . . . . . 6 ⊢ (𝑦 ∈ 𝒫 ∪ 𝐴 ↔ 𝑦 ⊆ ∪ 𝐴) | |
17 | 15, 16 | sylibr 236 | . . . . 5 ⊢ ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ 𝑦 = ∩ 𝑥) → 𝑦 ∈ 𝒫 ∪ 𝐴) |
18 | 17 | rexlimiva 3281 | . . . 4 ⊢ (∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = ∩ 𝑥 → 𝑦 ∈ 𝒫 ∪ 𝐴) |
19 | 18 | abssi 4046 | . . 3 ⊢ {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = ∩ 𝑥} ⊆ 𝒫 ∪ 𝐴 |
20 | uniexg 7466 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝐴 ∈ V) | |
21 | 20 | pwexd 5280 | . . 3 ⊢ (𝐴 ∈ 𝑉 → 𝒫 ∪ 𝐴 ∈ V) |
22 | ssexg 5227 | . . 3 ⊢ (({𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = ∩ 𝑥} ⊆ 𝒫 ∪ 𝐴 ∧ 𝒫 ∪ 𝐴 ∈ V) → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = ∩ 𝑥} ∈ V) | |
23 | 19, 21, 22 | sylancr 589 | . 2 ⊢ (𝐴 ∈ 𝑉 → {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = ∩ 𝑥} ∈ V) |
24 | 1, 5, 6, 23 | fvmptd3 6791 | 1 ⊢ (𝐴 ∈ 𝑉 → (fi‘𝐴) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 𝐴 ∩ Fin)𝑦 = ∩ 𝑥}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 {cab 2799 ≠ wne 3016 ∃wrex 3139 Vcvv 3494 ∩ cin 3935 ⊆ wss 3936 ∅c0 4291 𝒫 cpw 4539 ∪ cuni 4838 ∩ cint 4876 ‘cfv 6355 Fincfn 8509 ficfi 8874 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-int 4877 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-iota 6314 df-fun 6357 df-fv 6363 df-fi 8875 |
This theorem is referenced by: elfi 8877 fi0 8884 |
Copyright terms: Public domain | W3C validator |