| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elfir | 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 1024 | . . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ⊆ 𝐵) | |
| 2 | elpw2g 4268 | . . . . . 6 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝒫 𝐵 ↔ 𝐴 ⊆ 𝐵)) | |
| 3 | 1, 2 | imbitrrid 156 | . . . . 5 ⊢ (𝐵 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ∈ 𝒫 𝐵)) |
| 4 | 3 | imp 124 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ 𝒫 𝐵) |
| 5 | simpr3 1032 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ Fin) | |
| 6 | 4, 5 | elind 3404 | . . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ (𝒫 𝐵 ∩ Fin)) |
| 7 | eqid 2232 | . . 3 ⊢ ∩ 𝐴 = ∩ 𝐴 | |
| 8 | inteq 3952 | . . . 4 ⊢ (𝑥 = 𝐴 → ∩ 𝑥 = ∩ 𝐴) | |
| 9 | 8 | rspceeqv 2939 | . . 3 ⊢ ((𝐴 ∈ (𝒫 𝐵 ∩ Fin) ∧ ∩ 𝐴 = ∩ 𝐴) → ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥) |
| 10 | 6, 7, 9 | sylancl 413 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥) |
| 11 | simp2 1025 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ≠ ∅) | |
| 12 | fin0 7142 | . . . . . 6 ⊢ (𝐴 ∈ Fin → (𝐴 ≠ ∅ ↔ ∃𝑧 𝑧 ∈ 𝐴)) | |
| 13 | 12 | 3ad2ant3 1047 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ ↔ ∃𝑧 𝑧 ∈ 𝐴)) |
| 14 | 11, 13 | mpbid 147 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → ∃𝑧 𝑧 ∈ 𝐴) |
| 15 | inteximm 4261 | . . . 4 ⊢ (∃𝑧 𝑧 ∈ 𝐴 → ∩ 𝐴 ∈ V) | |
| 16 | 14, 15 | syl 14 | . . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → ∩ 𝐴 ∈ V) |
| 17 | id 19 | . . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ 𝑉) | |
| 18 | elfi 7258 | . . 3 ⊢ ((∩ 𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) → (∩ 𝐴 ∈ (fi‘𝐵) ↔ ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥)) | |
| 19 | 16, 17, 18 | syl2anr 290 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → (∩ 𝐴 ∈ (fi‘𝐵) ↔ ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥)) |
| 20 | 10, 19 | mpbird 167 | 1 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → ∩ 𝐴 ∈ (fi‘𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∃wex 1541 ∈ wcel 2203 ≠ wne 2412 ∃wrex 2521 Vcvv 2813 ∩ cin 3210 ⊆ wss 3211 ∅c0 3508 𝒫 cpw 3669 ∩ cint 3949 ‘cfv 5352 Fincfn 6975 ficfi 7255 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-iinf 4710 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-br 4110 df-opab 4172 df-mpt 4173 df-id 4414 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-er 6767 df-en 6976 df-fin 6978 df-fi 7256 |
| This theorem is referenced by: ssfii 7261 |
| Copyright terms: Public domain | W3C validator |