| 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 1000 | . . . . . 6 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ⊆ 𝐵) | |
| 2 | elpw2g 4216 | . . . . . 6 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝒫 𝐵 ↔ 𝐴 ⊆ 𝐵)) | |
| 3 | 1, 2 | imbitrrid 156 | . . . . 5 ⊢ (𝐵 ∈ 𝑉 → ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ∈ 𝒫 𝐵)) |
| 4 | 3 | imp 124 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ 𝒫 𝐵) |
| 5 | simpr3 1008 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ Fin) | |
| 6 | 4, 5 | elind 3366 | . . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → 𝐴 ∈ (𝒫 𝐵 ∩ Fin)) |
| 7 | eqid 2207 | . . 3 ⊢ ∩ 𝐴 = ∩ 𝐴 | |
| 8 | inteq 3902 | . . . 4 ⊢ (𝑥 = 𝐴 → ∩ 𝑥 = ∩ 𝐴) | |
| 9 | 8 | rspceeqv 2902 | . . 3 ⊢ ((𝐴 ∈ (𝒫 𝐵 ∩ Fin) ∧ ∩ 𝐴 = ∩ 𝐴) → ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥) |
| 10 | 6, 7, 9 | sylancl 413 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin)) → ∃𝑥 ∈ (𝒫 𝐵 ∩ Fin)∩ 𝐴 = ∩ 𝑥) |
| 11 | simp2 1001 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → 𝐴 ≠ ∅) | |
| 12 | fin0 7008 | . . . . . 6 ⊢ (𝐴 ∈ Fin → (𝐴 ≠ ∅ ↔ ∃𝑧 𝑧 ∈ 𝐴)) | |
| 13 | 12 | 3ad2ant3 1023 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → (𝐴 ≠ ∅ ↔ ∃𝑧 𝑧 ∈ 𝐴)) |
| 14 | 11, 13 | mpbid 147 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → ∃𝑧 𝑧 ∈ 𝐴) |
| 15 | inteximm 4209 | . . . 4 ⊢ (∃𝑧 𝑧 ∈ 𝐴 → ∩ 𝐴 ∈ V) | |
| 16 | 14, 15 | syl 14 | . . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅ ∧ 𝐴 ∈ Fin) → ∩ 𝐴 ∈ V) |
| 17 | id 19 | . . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ 𝑉) | |
| 18 | elfi 7099 | . . 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 981 = wceq 1373 ∃wex 1516 ∈ wcel 2178 ≠ wne 2378 ∃wrex 2487 Vcvv 2776 ∩ cin 3173 ⊆ wss 3174 ∅c0 3468 𝒫 cpw 3626 ∩ cint 3899 ‘cfv 5290 Fincfn 6850 ficfi 7096 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4178 ax-nul 4186 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-iinf 4654 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-ral 2491 df-rex 2492 df-v 2778 df-sbc 3006 df-csb 3102 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-nul 3469 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-int 3900 df-br 4060 df-opab 4122 df-mpt 4123 df-id 4358 df-suc 4436 df-iom 4657 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-rn 4704 df-res 4705 df-ima 4706 df-iota 5251 df-fun 5292 df-fn 5293 df-f 5294 df-f1 5295 df-fo 5296 df-f1o 5297 df-fv 5298 df-er 6643 df-en 6851 df-fin 6853 df-fi 7097 |
| This theorem is referenced by: ssfii 7102 |
| Copyright terms: Public domain | W3C validator |