| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssfii | Structured version Visualization version GIF version | ||
| Description: Any element of a set 𝐴 is the intersection of a finite subset of 𝐴. (Contributed by FL, 27-Apr-2008.) (Proof shortened by Mario Carneiro, 21-Mar-2015.) |
| Ref | Expression |
|---|---|
| ssfii | ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ (fi‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 3446 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 2 | 1 | intsn 4941 | . . . 4 ⊢ ∩ {𝑥} = 𝑥 |
| 3 | simpl 482 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐴) → 𝐴 ∈ 𝑉) | |
| 4 | simpr 484 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴) | |
| 5 | 4 | snssd 4767 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐴) → {𝑥} ⊆ 𝐴) |
| 6 | 1 | snnz 4735 | . . . . . 6 ⊢ {𝑥} ≠ ∅ |
| 7 | 6 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐴) → {𝑥} ≠ ∅) |
| 8 | snfi 8992 | . . . . . 6 ⊢ {𝑥} ∈ Fin | |
| 9 | 8 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐴) → {𝑥} ∈ Fin) |
| 10 | elfir 9330 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ ({𝑥} ⊆ 𝐴 ∧ {𝑥} ≠ ∅ ∧ {𝑥} ∈ Fin)) → ∩ {𝑥} ∈ (fi‘𝐴)) | |
| 11 | 3, 5, 7, 9, 10 | syl13anc 1375 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐴) → ∩ {𝑥} ∈ (fi‘𝐴)) |
| 12 | 2, 11 | eqeltrrid 2842 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ (fi‘𝐴)) |
| 13 | 12 | ex 412 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝐴 → 𝑥 ∈ (fi‘𝐴))) |
| 14 | 13 | ssrdv 3941 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ (fi‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2114 ≠ wne 2933 ⊆ wss 3903 ∅c0 4287 {csn 4582 ∩ cint 4904 ‘cfv 6500 Fincfn 8895 ficfi 9325 |
| 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 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 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-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-om 7819 df-1o 8407 df-en 8896 df-fin 8899 df-fi 9326 |
| This theorem is referenced by: fieq0 9336 dffi2 9338 inficl 9340 fiuni 9343 dffi3 9346 inffien 9985 fictb 10166 ordtbas2 23147 ordtbas 23148 ordtopn1 23150 ordtopn2 23151 leordtval2 23168 subbascn 23210 2ndcsb 23405 ptbasfi 23537 xkoopn 23545 fsubbas 23823 fbunfip 23825 isufil2 23864 ufileu 23875 filufint 23876 fmfnfmlem4 23913 fmfnfm 23914 hausflim 23937 flimclslem 23940 fclsfnflim 23983 flimfnfcls 23984 fclscmp 23986 alexsubb 24002 alexsubALTlem4 24006 ordtconnlem1 34101 topjoin 36578 |
| Copyright terms: Public domain | W3C validator |