| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > imasaddfn | GIF version | ||
| Description: The image structure's group operation is a function. (Contributed by Mario Carneiro, 23-Feb-2015.) (Revised by Mario Carneiro, 10-Jul-2015.) |
| Ref | Expression |
|---|---|
| imasaddf.f | ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵) |
| imasaddf.e | ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑝 · 𝑞)))) |
| imasaddf.u | ⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅)) |
| imasaddf.v | ⊢ (𝜑 → 𝑉 = (Base‘𝑅)) |
| imasaddf.r | ⊢ (𝜑 → 𝑅 ∈ 𝑍) |
| imasaddf.p | ⊢ · = (+g‘𝑅) |
| imasaddf.a | ⊢ ∙ = (+g‘𝑈) |
| Ref | Expression |
|---|---|
| imasaddfn | ⊢ (𝜑 → ∙ Fn (𝐵 × 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | imasaddf.f | . 2 ⊢ (𝜑 → 𝐹:𝑉–onto→𝐵) | |
| 2 | imasaddf.e | . 2 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑝 · 𝑞)))) | |
| 3 | imasaddf.u | . . 3 ⊢ (𝜑 → 𝑈 = (𝐹 “s 𝑅)) | |
| 4 | imasaddf.v | . . 3 ⊢ (𝜑 → 𝑉 = (Base‘𝑅)) | |
| 5 | imasaddf.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑍) | |
| 6 | imasaddf.p | . . 3 ⊢ · = (+g‘𝑅) | |
| 7 | imasaddf.a | . . 3 ⊢ ∙ = (+g‘𝑈) | |
| 8 | 3, 4, 1, 5, 6, 7 | imasplusg 13381 | . 2 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {〈〈(𝐹‘𝑝), (𝐹‘𝑞)〉, (𝐹‘(𝑝 · 𝑞))〉}) |
| 9 | basfn 13131 | . . . 4 ⊢ Base Fn V | |
| 10 | 5 | elexd 2814 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ V) |
| 11 | funfvex 5652 | . . . . 5 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V) | |
| 12 | 11 | funfni 5429 | . . . 4 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V) |
| 13 | 9, 10, 12 | sylancr 414 | . . 3 ⊢ (𝜑 → (Base‘𝑅) ∈ V) |
| 14 | 4, 13 | eqeltrd 2306 | . 2 ⊢ (𝜑 → 𝑉 ∈ V) |
| 15 | plusgslid 13185 | . . . . 5 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 16 | 15 | slotex 13099 | . . . 4 ⊢ (𝑅 ∈ 𝑍 → (+g‘𝑅) ∈ V) |
| 17 | 5, 16 | syl 14 | . . 3 ⊢ (𝜑 → (+g‘𝑅) ∈ V) |
| 18 | 6, 17 | eqeltrid 2316 | . 2 ⊢ (𝜑 → · ∈ V) |
| 19 | 1, 2, 8, 14, 18 | imasaddfnlemg 13387 | 1 ⊢ (𝜑 → ∙ Fn (𝐵 × 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 Vcvv 2800 × cxp 4721 Fn wfn 5319 –onto→wfo 5322 ‘cfv 5324 (class class class)co 6013 Basecbs 13072 +gcplusg 13150 “s cimas 13372 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-i2m1 8127 ax-0lt1 8128 ax-0id 8130 ax-rnegex 8131 ax-pre-ltirr 8134 ax-pre-ltadd 8138 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-tp 3675 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-ov 6016 df-oprab 6017 df-mpo 6018 df-pnf 8206 df-mnf 8207 df-ltxr 8209 df-inn 9134 df-2 9192 df-3 9193 df-ndx 13075 df-slot 13076 df-base 13078 df-plusg 13163 df-mulr 13164 df-iimas 13375 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |