| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > srgfcl | GIF version | ||
| Description: Functionality of the multiplication operation of a ring. (Contributed by Steve Rodriguez, 9-Sep-2007.) (Revised by AV, 24-Aug-2021.) |
| Ref | Expression |
|---|---|
| srgfcl.b | ⊢ 𝐵 = (Base‘𝑅) |
| srgfcl.t | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| srgfcl | ⊢ ((𝑅 ∈ SRing ∧ · Fn (𝐵 × 𝐵)) → · :(𝐵 × 𝐵)⟶𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 110 | . 2 ⊢ ((𝑅 ∈ SRing ∧ · Fn (𝐵 × 𝐵)) → · Fn (𝐵 × 𝐵)) | |
| 2 | srgfcl.b | . . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅) | |
| 3 | srgfcl.t | . . . . . . . 8 ⊢ · = (.r‘𝑅) | |
| 4 | 2, 3 | srgcl 13982 | . . . . . . 7 ⊢ ((𝑅 ∈ SRing ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎 · 𝑏) ∈ 𝐵) |
| 5 | 4 | 3expb 1230 | . . . . . 6 ⊢ ((𝑅 ∈ SRing ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎 · 𝑏) ∈ 𝐵) |
| 6 | 5 | ralrimivva 2614 | . . . . 5 ⊢ (𝑅 ∈ SRing → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎 · 𝑏) ∈ 𝐵) |
| 7 | fveq2 5639 | . . . . . . . 8 ⊢ (𝑐 = 〈𝑎, 𝑏〉 → ( · ‘𝑐) = ( · ‘〈𝑎, 𝑏〉)) | |
| 8 | 7 | eleq1d 2300 | . . . . . . 7 ⊢ (𝑐 = 〈𝑎, 𝑏〉 → (( · ‘𝑐) ∈ 𝐵 ↔ ( · ‘〈𝑎, 𝑏〉) ∈ 𝐵)) |
| 9 | df-ov 6020 | . . . . . . . . 9 ⊢ (𝑎 · 𝑏) = ( · ‘〈𝑎, 𝑏〉) | |
| 10 | 9 | eqcomi 2235 | . . . . . . . 8 ⊢ ( · ‘〈𝑎, 𝑏〉) = (𝑎 · 𝑏) |
| 11 | 10 | eleq1i 2297 | . . . . . . 7 ⊢ (( · ‘〈𝑎, 𝑏〉) ∈ 𝐵 ↔ (𝑎 · 𝑏) ∈ 𝐵) |
| 12 | 8, 11 | bitrdi 196 | . . . . . 6 ⊢ (𝑐 = 〈𝑎, 𝑏〉 → (( · ‘𝑐) ∈ 𝐵 ↔ (𝑎 · 𝑏) ∈ 𝐵)) |
| 13 | 12 | ralxp 4873 | . . . . 5 ⊢ (∀𝑐 ∈ (𝐵 × 𝐵)( · ‘𝑐) ∈ 𝐵 ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎 · 𝑏) ∈ 𝐵) |
| 14 | 6, 13 | sylibr 134 | . . . 4 ⊢ (𝑅 ∈ SRing → ∀𝑐 ∈ (𝐵 × 𝐵)( · ‘𝑐) ∈ 𝐵) |
| 15 | 14 | adantr 276 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ · Fn (𝐵 × 𝐵)) → ∀𝑐 ∈ (𝐵 × 𝐵)( · ‘𝑐) ∈ 𝐵) |
| 16 | fnfvrnss 5807 | . . 3 ⊢ (( · Fn (𝐵 × 𝐵) ∧ ∀𝑐 ∈ (𝐵 × 𝐵)( · ‘𝑐) ∈ 𝐵) → ran · ⊆ 𝐵) | |
| 17 | 1, 15, 16 | syl2anc 411 | . 2 ⊢ ((𝑅 ∈ SRing ∧ · Fn (𝐵 × 𝐵)) → ran · ⊆ 𝐵) |
| 18 | df-f 5330 | . 2 ⊢ ( · :(𝐵 × 𝐵)⟶𝐵 ↔ ( · Fn (𝐵 × 𝐵) ∧ ran · ⊆ 𝐵)) | |
| 19 | 1, 17, 18 | sylanbrc 417 | 1 ⊢ ((𝑅 ∈ SRing ∧ · Fn (𝐵 × 𝐵)) → · :(𝐵 × 𝐵)⟶𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 ∀wral 2510 ⊆ wss 3200 〈cop 3672 × cxp 4723 ran crn 4726 Fn wfn 5321 ⟶wf 5322 ‘cfv 5326 (class class class)co 6017 Basecbs 13081 .rcmulr 13160 SRingcsrg 13975 |
| 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-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-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-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-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-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-riota 5970 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-sets 13088 df-plusg 13172 df-mulr 13173 df-0g 13340 df-mgm 13438 df-sgrp 13484 df-mnd 13499 df-mgp 13933 df-srg 13976 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |