Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > lmfss | GIF version |
Description: Inclusion of a function having a limit (used to ensure the limit relation is a set, under our definition). (Contributed by NM, 7-Dec-2006.) (Revised by Mario Carneiro, 23-Dec-2013.) |
Ref | Expression |
---|---|
lmfss | ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹(⇝𝑡‘𝐽)𝑃) → 𝐹 ⊆ (ℂ × 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lmfpm 12417 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹(⇝𝑡‘𝐽)𝑃) → 𝐹 ∈ (𝑋 ↑pm ℂ)) | |
2 | toponmax 12197 | . . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽) | |
3 | cnex 7749 | . . . . 5 ⊢ ℂ ∈ V | |
4 | elpmg 6558 | . . . . 5 ⊢ ((𝑋 ∈ 𝐽 ∧ ℂ ∈ V) → (𝐹 ∈ (𝑋 ↑pm ℂ) ↔ (Fun 𝐹 ∧ 𝐹 ⊆ (ℂ × 𝑋)))) | |
5 | 2, 3, 4 | sylancl 409 | . . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝐹 ∈ (𝑋 ↑pm ℂ) ↔ (Fun 𝐹 ∧ 𝐹 ⊆ (ℂ × 𝑋)))) |
6 | 5 | adantr 274 | . . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹(⇝𝑡‘𝐽)𝑃) → (𝐹 ∈ (𝑋 ↑pm ℂ) ↔ (Fun 𝐹 ∧ 𝐹 ⊆ (ℂ × 𝑋)))) |
7 | 1, 6 | mpbid 146 | . 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹(⇝𝑡‘𝐽)𝑃) → (Fun 𝐹 ∧ 𝐹 ⊆ (ℂ × 𝑋))) |
8 | 7 | simprd 113 | 1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹(⇝𝑡‘𝐽)𝑃) → 𝐹 ⊆ (ℂ × 𝑋)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 1480 Vcvv 2686 ⊆ wss 3071 class class class wbr 3929 × cxp 4537 Fun wfun 5117 ‘cfv 5123 (class class class)co 5774 ↑pm cpm 6543 ℂcc 7623 TopOnctopon 12182 ⇝𝑡clm 12361 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7716 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-fv 5131 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-pm 6545 df-top 12170 df-topon 12183 df-lm 12364 |
This theorem is referenced by: lmss 12420 |
Copyright terms: Public domain | W3C validator |