| 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 13390 | . 2 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {〈〈(𝐹‘𝑝), (𝐹‘𝑞)〉, (𝐹‘(𝑝 · 𝑞))〉}) |
| 9 | basfn 13140 | . . . 4 ⊢ Base Fn V | |
| 10 | 5 | elexd 2816 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ V) |
| 11 | funfvex 5656 | . . . . 5 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V) | |
| 12 | 11 | funfni 5432 | . . . 4 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V) |
| 13 | 9, 10, 12 | sylancr 414 | . . 3 ⊢ (𝜑 → (Base‘𝑅) ∈ V) |
| 14 | 4, 13 | eqeltrd 2308 | . 2 ⊢ (𝜑 → 𝑉 ∈ V) |
| 15 | plusgslid 13194 | . . . . 5 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 16 | 15 | slotex 13108 | . . . 4 ⊢ (𝑅 ∈ 𝑍 → (+g‘𝑅) ∈ V) |
| 17 | 5, 16 | syl 14 | . . 3 ⊢ (𝜑 → (+g‘𝑅) ∈ V) |
| 18 | 6, 17 | eqeltrid 2318 | . 2 ⊢ (𝜑 → · ∈ V) |
| 19 | 1, 2, 8, 14, 18 | imasaddfnlemg 13396 | 1 ⊢ (𝜑 → ∙ Fn (𝐵 × 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 Vcvv 2802 × cxp 4723 Fn wfn 5321 –onto→wfo 5324 ‘cfv 5326 (class class class)co 6017 Basecbs 13081 +gcplusg 13159 “s cimas 13381 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-pre-ltirr 8143 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-tp 3677 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-ov 6020 df-oprab 6021 df-mpo 6022 df-pnf 8215 df-mnf 8216 df-ltxr 8218 df-inn 9143 df-2 9201 df-3 9202 df-ndx 13084 df-slot 13085 df-base 13087 df-plusg 13172 df-mulr 13173 df-iimas 13384 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |