![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > pmresg | GIF version |
Description: Elementhood of a restricted function in the set of partial functions. (Contributed by Mario Carneiro, 31-Dec-2013.) |
Ref | Expression |
---|---|
pmresg | ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-pm 6553 | . . . 4 ⊢ ↑pm = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∈ 𝒫 (𝑦 × 𝑥) ∣ Fun 𝑓}) | |
2 | 1 | elmpocl1 5977 | . . 3 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → 𝐴 ∈ V) |
3 | 2 | adantl 275 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → 𝐴 ∈ V) |
4 | simpl 108 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → 𝐵 ∈ 𝑉) | |
5 | elpmi 6569 | . . . . . 6 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → (𝐹:dom 𝐹⟶𝐴 ∧ dom 𝐹 ⊆ 𝐶)) | |
6 | 5 | simpld 111 | . . . . 5 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → 𝐹:dom 𝐹⟶𝐴) |
7 | 6 | adantl 275 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → 𝐹:dom 𝐹⟶𝐴) |
8 | inss1 3301 | . . . 4 ⊢ (dom 𝐹 ∩ 𝐵) ⊆ dom 𝐹 | |
9 | fssres 5306 | . . . 4 ⊢ ((𝐹:dom 𝐹⟶𝐴 ∧ (dom 𝐹 ∩ 𝐵) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)):(dom 𝐹 ∩ 𝐵)⟶𝐴) | |
10 | 7, 8, 9 | sylancl 410 | . . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)):(dom 𝐹 ∩ 𝐵)⟶𝐴) |
11 | ffun 5283 | . . . . 5 ⊢ (𝐹:dom 𝐹⟶𝐴 → Fun 𝐹) | |
12 | resres 4839 | . . . . . 6 ⊢ ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ (dom 𝐹 ∩ 𝐵)) | |
13 | funrel 5148 | . . . . . . 7 ⊢ (Fun 𝐹 → Rel 𝐹) | |
14 | resdm 4866 | . . . . . . 7 ⊢ (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹) | |
15 | reseq1 4821 | . . . . . . 7 ⊢ ((𝐹 ↾ dom 𝐹) = 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ 𝐵)) | |
16 | 13, 14, 15 | 3syl 17 | . . . . . 6 ⊢ (Fun 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ 𝐵)) |
17 | 12, 16 | syl5eqr 2187 | . . . . 5 ⊢ (Fun 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)) = (𝐹 ↾ 𝐵)) |
18 | 7, 11, 17 | 3syl 17 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)) = (𝐹 ↾ 𝐵)) |
19 | 18 | feq1d 5267 | . . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → ((𝐹 ↾ (dom 𝐹 ∩ 𝐵)):(dom 𝐹 ∩ 𝐵)⟶𝐴 ↔ (𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴)) |
20 | 10, 19 | mpbid 146 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴) |
21 | inss2 3302 | . . 3 ⊢ (dom 𝐹 ∩ 𝐵) ⊆ 𝐵 | |
22 | elpm2r 6568 | . . 3 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) ∧ ((𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴 ∧ (dom 𝐹 ∩ 𝐵) ⊆ 𝐵)) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵)) | |
23 | 21, 22 | mpanr2 435 | . 2 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) ∧ (𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵)) |
24 | 3, 4, 20, 23 | syl21anc 1216 | 1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1332 ∈ wcel 1481 {crab 2421 Vcvv 2689 ∩ cin 3075 ⊆ wss 3076 𝒫 cpw 3515 × cxp 4545 dom cdm 4547 ↾ cres 4549 Rel wrel 4552 Fun wfun 5125 ⟶wf 5127 (class class class)co 5782 ↑pm cpm 6551 |
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 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 ax-un 4363 ax-setind 4460 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-ral 2422 df-rex 2423 df-rab 2426 df-v 2691 df-sbc 2914 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-br 3938 df-opab 3998 df-id 4223 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-res 4559 df-iota 5096 df-fun 5133 df-fn 5134 df-f 5135 df-fv 5139 df-ov 5785 df-oprab 5786 df-mpo 5787 df-pm 6553 |
This theorem is referenced by: lmres 12456 |
Copyright terms: Public domain | W3C validator |