| 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 1023 | . . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ⊆ 𝐵) | |
| 2 | elpw2g 4246 | . . . . . 6 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝒫 𝐵 ↔ 𝐴 ⊆ 𝐵)) | |
| 3 | 1, 2 | imbitrrid 156 | . . . . 5 ⊢ (𝐵 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ∈ 𝒫 𝐵)) |
| 4 | 3 | imp 124 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ 𝒫 𝐵) |
| 5 | simpr3 1031 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ Fin) | |
| 6 | 4, 5 | elind 3392 | . . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ (𝒫 𝐵 ∩ Fin)) |
| 7 | eqid 2231 | . . 3 ⊢ ∩ 𝐴 = ∩ 𝐴 | |
| 8 | inteq 3931 | . . . 4 ⊢ (𝑥 = 𝐴 → ∩ 𝑥 = ∩ 𝐴) | |
| 9 | 8 | rspceeqv 2928 | . . 3 ⊢ ((𝐴 ∈ (𝒫 𝐵 ∩ Fin) ∧ ∩ 𝐴 = ∩ 𝐴) → ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥) |
| 10 | 6, 7, 9 | sylancl 413 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥) |
| 11 | simp2 1024 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ≠ ∅) | |
| 12 | fin0 7073 | . . . . . 6 ⊢ (𝐴 ∈ Fin → (𝐴 ≠ ∅ ↔ ∃𝑧 𝑧 ∈ 𝐴)) | |
| 13 | 12 | 3ad2ant3 1046 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ ↔ ∃𝑧 𝑧 ∈ 𝐴)) |
| 14 | 11, 13 | mpbid 147 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → ∃𝑧 𝑧 ∈ 𝐴) |
| 15 | inteximm 4239 | . . . 4 ⊢ (∃𝑧 𝑧 ∈ 𝐴 → ∩ 𝐴 ∈ V) | |
| 16 | 14, 15 | syl 14 | . . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → ∩ 𝐴 ∈ V) |
| 17 | id 19 | . . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ 𝑉) | |
| 18 | elfi 7169 | . . 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 1004 = wceq 1397 ∃wex 1540 ∈ wcel 2202 ≠ wne 2402 ∃wrex 2511 Vcvv 2802 ∩ cin 3199 ⊆ wss 3200 ∅c0 3494 𝒫 cpw 3652 ∩ cint 3928 ‘cfv 5326 Fincfn 6908 ficfi 7166 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-iinf 4686 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-er 6701 df-en 6909 df-fin 6911 df-fi 7167 |
| This theorem is referenced by: ssfii 7172 |
| Copyright terms: Public domain | W3C validator |