| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > off | GIF version | ||
| Description: The function operation produces a function. (Contributed by Mario Carneiro, 20-Jul-2014.) |
| Ref | Expression |
|---|---|
| off.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑇)) → (𝑥𝑅𝑦) ∈ 𝑈) |
| off.2 | ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) |
| off.3 | ⊢ (𝜑 → 𝐺:𝐵⟶𝑇) |
| off.4 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| off.5 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
| off.6 | ⊢ (𝐴 ∩ 𝐵) = 𝐶 |
| Ref | Expression |
|---|---|
| off | ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺):𝐶⟶𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | off.2 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) | |
| 2 | off.6 | . . . . . . 7 ⊢ (𝐴 ∩ 𝐵) = 𝐶 | |
| 3 | inss1 3451 | . . . . . . 7 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 4 | 2, 3 | eqsstrri 3281 | . . . . . 6 ⊢ 𝐶 ⊆ 𝐴 |
| 5 | 4 | sseli 3244 | . . . . 5 ⊢ (𝑧 ∈ 𝐶 → 𝑧 ∈ 𝐴) |
| 6 | ffvelcdm 5844 | . . . . 5 ⊢ ((𝐹:𝐴⟶𝑆 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) ∈ 𝑆) | |
| 7 | 1, 5, 6 | syl2an 289 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐶) → (𝐹‘𝑧) ∈ 𝑆) |
| 8 | off.3 | . . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝑇) | |
| 9 | inss2 3452 | . . . . . . 7 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
| 10 | 2, 9 | eqsstrri 3281 | . . . . . 6 ⊢ 𝐶 ⊆ 𝐵 |
| 11 | 10 | sseli 3244 | . . . . 5 ⊢ (𝑧 ∈ 𝐶 → 𝑧 ∈ 𝐵) |
| 12 | ffvelcdm 5844 | . . . . 5 ⊢ ((𝐺:𝐵⟶𝑇 ∧ 𝑧 ∈ 𝐵) → (𝐺‘𝑧) ∈ 𝑇) | |
| 13 | 8, 11, 12 | syl2an 289 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐶) → (𝐺‘𝑧) ∈ 𝑇) |
| 14 | off.1 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑇)) → (𝑥𝑅𝑦) ∈ 𝑈) | |
| 15 | 14 | ralrimivva 2632 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥𝑅𝑦) ∈ 𝑈) |
| 16 | 15 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐶) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥𝑅𝑦) ∈ 𝑈) |
| 17 | oveq1 6095 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝑧) → (𝑥𝑅𝑦) = ((𝐹‘𝑧)𝑅𝑦)) | |
| 18 | 17 | eleq1d 2307 | . . . . 5 ⊢ (𝑥 = (𝐹‘𝑧) → ((𝑥𝑅𝑦) ∈ 𝑈 ↔ ((𝐹‘𝑧)𝑅𝑦) ∈ 𝑈)) |
| 19 | oveq2 6096 | . . . . . 6 ⊢ (𝑦 = (𝐺‘𝑧) → ((𝐹‘𝑧)𝑅𝑦) = ((𝐹‘𝑧)𝑅(𝐺‘𝑧))) | |
| 20 | 19 | eleq1d 2307 | . . . . 5 ⊢ (𝑦 = (𝐺‘𝑧) → (((𝐹‘𝑧)𝑅𝑦) ∈ 𝑈 ↔ ((𝐹‘𝑧)𝑅(𝐺‘𝑧)) ∈ 𝑈)) |
| 21 | 18, 20 | rspc2va 2944 | . . . 4 ⊢ ((((𝐹‘𝑧) ∈ 𝑆 ∧ (𝐺‘𝑧) ∈ 𝑇) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑇 (𝑥𝑅𝑦) ∈ 𝑈) → ((𝐹‘𝑧)𝑅(𝐺‘𝑧)) ∈ 𝑈) |
| 22 | 7, 13, 16, 21 | syl21anc 1277 | . . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐶) → ((𝐹‘𝑧)𝑅(𝐺‘𝑧)) ∈ 𝑈) |
| 23 | eqid 2238 | . . 3 ⊢ (𝑧 ∈ 𝐶 ↦ ((𝐹‘𝑧)𝑅(𝐺‘𝑧))) = (𝑧 ∈ 𝐶 ↦ ((𝐹‘𝑧)𝑅(𝐺‘𝑧))) | |
| 24 | 22, 23 | fmptd 5865 | . 2 ⊢ (𝜑 → (𝑧 ∈ 𝐶 ↦ ((𝐹‘𝑧)𝑅(𝐺‘𝑧))):𝐶⟶𝑈) |
| 25 | ffn 5536 | . . . . 5 ⊢ (𝐹:𝐴⟶𝑆 → 𝐹 Fn 𝐴) | |
| 26 | 1, 25 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| 27 | ffn 5536 | . . . . 5 ⊢ (𝐺:𝐵⟶𝑇 → 𝐺 Fn 𝐵) | |
| 28 | 8, 27 | syl 14 | . . . 4 ⊢ (𝜑 → 𝐺 Fn 𝐵) |
| 29 | off.4 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 30 | off.5 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 31 | eqidd 2239 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) = (𝐹‘𝑧)) | |
| 32 | eqidd 2239 | . . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐵) → (𝐺‘𝑧) = (𝐺‘𝑧)) | |
| 33 | 26, 28, 29, 30, 2, 31, 32 | offval 6314 | . . 3 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑧 ∈ 𝐶 ↦ ((𝐹‘𝑧)𝑅(𝐺‘𝑧)))) |
| 34 | 33 | feq1d 5523 | . 2 ⊢ (𝜑 → ((𝐹 ∘𝑓 𝑅𝐺):𝐶⟶𝑈 ↔ (𝑧 ∈ 𝐶 ↦ ((𝐹‘𝑧)𝑅(𝐺‘𝑧))):𝐶⟶𝑈)) |
| 35 | 24, 34 | mpbird 167 | 1 ⊢ (𝜑 → (𝐹 ∘𝑓 𝑅𝐺):𝐶⟶𝑈) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∀wral 2528 ∩ cin 3219 ↦ cmpt 4193 Fn wfn 5375 ⟶wf 5376 ‘cfv 5380 (class class class)co 6088 ∘𝑓 cof 6303 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-setind 4686 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-ov 6091 df-oprab 6092 df-mpo 6093 df-of 6305 |
| This theorem is used by: offeq 6320 suppofss1dcl 6508 suppofss2dcl 6509 ofsubeq0 9300 ofnegsub 9301 lcomf 14773 psrbagaddclfi 15170 psrbagcon 15171 psraddcl 15184 mplsubgfilemcl 15215 dvaddxxbr 15927 dvmulxxbr 15928 dvaddxx 15929 dvmulxx 15930 dviaddf 15931 dvimulf 15932 plyaddlem 15975 |
| Copyright terms: Public domain | W3C validator |