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 6599 | . . . 4 ⊢ ↑pm = (𝑥 ∈ V, 𝑦 ∈ V ↦ {𝑓 ∈ 𝒫 (𝑦 × 𝑥) ∣ Fun 𝑓}) | |
2 | 1 | elmpocl1 6022 | . . 3 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → 𝐴 ∈ V) |
3 | 2 | adantl 275 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → 𝐴 ∈ V) |
4 | simpl 108 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → 𝐵 ∈ 𝑉) | |
5 | elpmi 6615 | . . . . . 6 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → (𝐹:dom 𝐹⟶𝐴 ∧ dom 𝐹 ⊆ 𝐶)) | |
6 | 5 | simpld 111 | . . . . 5 ⊢ (𝐹 ∈ (𝐴 ↑pm 𝐶) → 𝐹:dom 𝐹⟶𝐴) |
7 | 6 | adantl 275 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → 𝐹:dom 𝐹⟶𝐴) |
8 | inss1 3328 | . . . 4 ⊢ (dom 𝐹 ∩ 𝐵) ⊆ dom 𝐹 | |
9 | fssres 5348 | . . . 4 ⊢ ((𝐹:dom 𝐹⟶𝐴 ∧ (dom 𝐹 ∩ 𝐵) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)):(dom 𝐹 ∩ 𝐵)⟶𝐴) | |
10 | 7, 8, 9 | sylancl 410 | . . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)):(dom 𝐹 ∩ 𝐵)⟶𝐴) |
11 | ffun 5325 | . . . . 5 ⊢ (𝐹:dom 𝐹⟶𝐴 → Fun 𝐹) | |
12 | resres 4881 | . . . . . 6 ⊢ ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ (dom 𝐹 ∩ 𝐵)) | |
13 | funrel 5190 | . . . . . . 7 ⊢ (Fun 𝐹 → Rel 𝐹) | |
14 | resdm 4908 | . . . . . . 7 ⊢ (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹) | |
15 | reseq1 4863 | . . . . . . 7 ⊢ ((𝐹 ↾ dom 𝐹) = 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ 𝐵)) | |
16 | 13, 14, 15 | 3syl 17 | . . . . . 6 ⊢ (Fun 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐵) = (𝐹 ↾ 𝐵)) |
17 | 12, 16 | eqtr3id 2204 | . . . . 5 ⊢ (Fun 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)) = (𝐹 ↾ 𝐵)) |
18 | 7, 11, 17 | 3syl 17 | . . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ (dom 𝐹 ∩ 𝐵)) = (𝐹 ↾ 𝐵)) |
19 | 18 | feq1d 5309 | . . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → ((𝐹 ↾ (dom 𝐹 ∩ 𝐵)):(dom 𝐹 ∩ 𝐵)⟶𝐴 ↔ (𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴)) |
20 | 10, 19 | mpbid 146 | . 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴) |
21 | inss2 3329 | . . 3 ⊢ (dom 𝐹 ∩ 𝐵) ⊆ 𝐵 | |
22 | elpm2r 6614 | . . 3 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) ∧ ((𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴 ∧ (dom 𝐹 ∩ 𝐵) ⊆ 𝐵)) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵)) | |
23 | 21, 22 | mpanr2 435 | . 2 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ 𝑉) ∧ (𝐹 ↾ 𝐵):(dom 𝐹 ∩ 𝐵)⟶𝐴) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵)) |
24 | 3, 4, 20, 23 | syl21anc 1219 | 1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹 ∈ (𝐴 ↑pm 𝐶)) → (𝐹 ↾ 𝐵) ∈ (𝐴 ↑pm 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1335 ∈ wcel 2128 {crab 2439 Vcvv 2712 ∩ cin 3101 ⊆ wss 3102 𝒫 cpw 3544 × cxp 4587 dom cdm 4589 ↾ cres 4591 Rel wrel 4594 Fun wfun 5167 ⟶wf 5169 (class class class)co 5827 ↑pm cpm 6597 |
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 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-13 2130 ax-14 2131 ax-ext 2139 ax-sep 4085 ax-pow 4138 ax-pr 4172 ax-un 4396 ax-setind 4499 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-ral 2440 df-rex 2441 df-rab 2444 df-v 2714 df-sbc 2938 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-pw 3546 df-sn 3567 df-pr 3568 df-op 3570 df-uni 3775 df-br 3968 df-opab 4029 df-id 4256 df-xp 4595 df-rel 4596 df-cnv 4597 df-co 4598 df-dm 4599 df-rn 4600 df-res 4601 df-iota 5138 df-fun 5175 df-fn 5176 df-f 5177 df-fv 5181 df-ov 5830 df-oprab 5831 df-mpo 5832 df-pm 6599 |
This theorem is referenced by: lmres 12744 |
Copyright terms: Public domain | W3C validator |