Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > elpm2r | GIF version |
Description: Sufficient condition for being a partial function. (Contributed by NM, 31-Dec-2013.) |
Ref | Expression |
---|---|
elpm2r | ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐹:𝐶⟶𝐴 ∧ 𝐶 ⊆ 𝐵)) → 𝐹 ∈ (𝐴 ↑pm 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fdm 5337 | . . . . . . 7 ⊢ (𝐹:𝐶⟶𝐴 → dom 𝐹 = 𝐶) | |
2 | 1 | feq2d 5319 | . . . . . 6 ⊢ (𝐹:𝐶⟶𝐴 → (𝐹:dom 𝐹⟶𝐴 ↔ 𝐹:𝐶⟶𝐴)) |
3 | 1 | sseq1d 3166 | . . . . . 6 ⊢ (𝐹:𝐶⟶𝐴 → (dom 𝐹 ⊆ 𝐵 ↔ 𝐶 ⊆ 𝐵)) |
4 | 2, 3 | anbi12d 465 | . . . . 5 ⊢ (𝐹:𝐶⟶𝐴 → ((𝐹:dom 𝐹⟶𝐴 ∧ dom 𝐹 ⊆ 𝐵) ↔ (𝐹:𝐶⟶𝐴 ∧ 𝐶 ⊆ 𝐵))) |
5 | 4 | adantr 274 | . . . 4 ⊢ ((𝐹:𝐶⟶𝐴 ∧ 𝐶 ⊆ 𝐵) → ((𝐹:dom 𝐹⟶𝐴 ∧ dom 𝐹 ⊆ 𝐵) ↔ (𝐹:𝐶⟶𝐴 ∧ 𝐶 ⊆ 𝐵))) |
6 | 5 | ibir 176 | . . 3 ⊢ ((𝐹:𝐶⟶𝐴 ∧ 𝐶 ⊆ 𝐵) → (𝐹:dom 𝐹⟶𝐴 ∧ dom 𝐹 ⊆ 𝐵)) |
7 | elpm2g 6622 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐹 ∈ (𝐴 ↑pm 𝐵) ↔ (𝐹:dom 𝐹⟶𝐴 ∧ dom 𝐹 ⊆ 𝐵))) | |
8 | 6, 7 | syl5ibr 155 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐹:𝐶⟶𝐴 ∧ 𝐶 ⊆ 𝐵) → 𝐹 ∈ (𝐴 ↑pm 𝐵))) |
9 | 8 | imp 123 | 1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐹:𝐶⟶𝐴 ∧ 𝐶 ⊆ 𝐵)) → 𝐹 ∈ (𝐴 ↑pm 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 2135 ⊆ wss 3111 dom cdm 4598 ⟶wf 5178 (class class class)co 5836 ↑pm cpm 6606 |
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 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-13 2137 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 ax-un 4405 ax-setind 4508 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-fal 1348 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ne 2335 df-ral 2447 df-rex 2448 df-rab 2451 df-v 2723 df-sbc 2947 df-dif 3113 df-un 3115 df-in 3117 df-ss 3124 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-br 3977 df-opab 4038 df-id 4265 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-fv 5190 df-ov 5839 df-oprab 5840 df-mpo 5841 df-pm 6608 |
This theorem is referenced by: fpmg 6631 pmresg 6633 ennnfonelemg 12279 lmbrf 12762 ellimc3apf 13176 dvfvalap 13197 dvmulxxbr 13213 dvaddxx 13214 dvmulxx 13215 dviaddf 13216 dvimulf 13217 dvcoapbr 13218 dvmptclx 13227 |
Copyright terms: Public domain | W3C validator |