| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elfir | Structured version Visualization version GIF version | ||
| Description: Sufficient condition for an element of (fi‘𝐵). (Contributed by Mario Carneiro, 24-Nov-2013.) |
| Ref | Expression |
|---|---|
| elfir | ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → ∩ 𝐴 ∈ (fi‘𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1137 | . . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ⊆ 𝐵) | |
| 2 | elpw2g 5280 | . . . . . 6 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝒫 𝐵 ↔ 𝐴 ⊆ 𝐵)) | |
| 3 | 1, 2 | imbitrrid 246 | . . . . 5 ⊢ (𝐵 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ∈ 𝒫 𝐵)) |
| 4 | 3 | imp 406 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ 𝒫 𝐵) |
| 5 | simpr3 1198 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ Fin) | |
| 6 | 4, 5 | elind 4154 | . . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ (𝒫 𝐵 ∩ Fin)) |
| 7 | eqid 2737 | . . 3 ⊢ ∩ 𝐴 = ∩ 𝐴 | |
| 8 | inteq 4907 | . . . 4 ⊢ (𝑥 = 𝐴 → ∩ 𝑥 = ∩ 𝐴) | |
| 9 | 8 | rspceeqv 3601 | . . 3 ⊢ ((𝐴 ∈ (𝒫 𝐵 ∩ Fin) ∧ ∩ 𝐴 = ∩ 𝐴) → ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥) |
| 10 | 6, 7, 9 | sylancl 587 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥) |
| 11 | simp2 1138 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ≠ ∅) | |
| 12 | intex 5291 | . . . 4 ⊢ (𝐴 ≠ ∅ ↔ ∩ 𝐴 ∈ V) | |
| 13 | 11, 12 | sylib 218 | . . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → ∩ 𝐴 ∈ V) |
| 14 | id 22 | . . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ 𝑉) | |
| 15 | elfi 9328 | . . 3 ⊢ ((∩ 𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) → (∩ 𝐴 ∈ (fi‘𝐵) ↔ ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥)) | |
| 16 | 13, 14, 15 | syl2anr 598 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → (∩ 𝐴 ∈ (fi‘𝐵) ↔ ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥)) |
| 17 | 10, 16 | mpbird 257 | 1 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → ∩ 𝐴 ∈ (fi‘𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∃wrex 3062 Vcvv 3442 ∩ cin 3902 ⊆ wss 3903 ∅c0 4287 𝒫 cpw 4556 ∩ 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-pow 5312 ax-pr 5379 ax-un 7690 |
| 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-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-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-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-iota 6456 df-fun 6502 df-fv 6508 df-fi 9326 |
| This theorem is referenced by: intrnfi 9331 ssfii 9334 elfiun 9345 ptbasfi 23537 fbssint 23794 filintn0 23817 alexsublem 24000 ispisys2 34331 |
| Copyright terms: Public domain | W3C validator |