| 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 13817 | . . . . . . 7 ⊢ ((𝑅 ∈ SRing ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎 · 𝑏) ∈ 𝐵) |
| 5 | 4 | 3expb 1207 | . . . . . 6 ⊢ ((𝑅 ∈ SRing ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎 · 𝑏) ∈ 𝐵) |
| 6 | 5 | ralrimivva 2589 | . . . . 5 ⊢ (𝑅 ∈ SRing → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎 · 𝑏) ∈ 𝐵) |
| 7 | fveq2 5594 | . . . . . . . 8 ⊢ (𝑐 = 〈𝑎, 𝑏〉 → ( · ‘𝑐) = ( · ‘〈𝑎, 𝑏〉)) | |
| 8 | 7 | eleq1d 2275 | . . . . . . 7 ⊢ (𝑐 = 〈𝑎, 𝑏〉 → (( · ‘𝑐) ∈ 𝐵 ↔ ( · ‘〈𝑎, 𝑏〉) ∈ 𝐵)) |
| 9 | df-ov 5965 | . . . . . . . . 9 ⊢ (𝑎 · 𝑏) = ( · ‘〈𝑎, 𝑏〉) | |
| 10 | 9 | eqcomi 2210 | . . . . . . . 8 ⊢ ( · ‘〈𝑎, 𝑏〉) = (𝑎 · 𝑏) |
| 11 | 10 | eleq1i 2272 | . . . . . . 7 ⊢ (( · ‘〈𝑎, 𝑏〉) ∈ 𝐵 ↔ (𝑎 · 𝑏) ∈ 𝐵) |
| 12 | 8, 11 | bitrdi 196 | . . . . . 6 ⊢ (𝑐 = 〈𝑎, 𝑏〉 → (( · ‘𝑐) ∈ 𝐵 ↔ (𝑎 · 𝑏) ∈ 𝐵)) |
| 13 | 12 | ralxp 4834 | . . . . 5 ⊢ (∀𝑐 ∈ (𝐵 × 𝐵)( · ‘𝑐) ∈ 𝐵 ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎 · 𝑏) ∈ 𝐵) |
| 14 | 6, 13 | sylibr 134 | . . . 4 ⊢ (𝑅 ∈ SRing → ∀𝑐 ∈ (𝐵 × 𝐵)( · ‘𝑐) ∈ 𝐵) |
| 15 | 14 | adantr 276 | . . 3 ⊢ ((𝑅 ∈ SRing ∧ · Fn (𝐵 × 𝐵)) → ∀𝑐 ∈ (𝐵 × 𝐵)( · ‘𝑐) ∈ 𝐵) |
| 16 | fnfvrnss 5758 | . . 3 ⊢ (( · Fn (𝐵 × 𝐵) ∧ ∀𝑐 ∈ (𝐵 × 𝐵)( · ‘𝑐) ∈ 𝐵) → ran · ⊆ 𝐵) | |
| 17 | 1, 15, 16 | syl2anc 411 | . 2 ⊢ ((𝑅 ∈ SRing ∧ · Fn (𝐵 × 𝐵)) → ran · ⊆ 𝐵) |
| 18 | df-f 5289 | . 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 1373 ∈ wcel 2177 ∀wral 2485 ⊆ wss 3170 〈cop 3641 × cxp 4686 ran crn 4689 Fn wfn 5280 ⟶wf 5281 ‘cfv 5285 (class class class)co 5962 Basecbs 12917 .rcmulr 12995 SRingcsrg 13810 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-sep 4173 ax-pow 4229 ax-pr 4264 ax-un 4493 ax-setind 4598 ax-cnex 8046 ax-resscn 8047 ax-1cn 8048 ax-1re 8049 ax-icn 8050 ax-addcl 8051 ax-addrcl 8052 ax-mulcl 8053 ax-addcom 8055 ax-addass 8057 ax-i2m1 8060 ax-0lt1 8061 ax-0id 8063 ax-rnegex 8064 ax-pre-ltirr 8067 ax-pre-ltadd 8071 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3860 df-int 3895 df-iun 3938 df-br 4055 df-opab 4117 df-mpt 4118 df-id 4353 df-xp 4694 df-rel 4695 df-cnv 4696 df-co 4697 df-dm 4698 df-rn 4699 df-res 4700 df-iota 5246 df-fun 5287 df-fn 5288 df-f 5289 df-fv 5293 df-riota 5917 df-ov 5965 df-oprab 5966 df-mpo 5967 df-pnf 8139 df-mnf 8140 df-ltxr 8142 df-inn 9067 df-2 9125 df-3 9126 df-ndx 12920 df-slot 12921 df-base 12923 df-sets 12924 df-plusg 13007 df-mulr 13008 df-0g 13175 df-mgm 13273 df-sgrp 13319 df-mnd 13334 df-mgp 13768 df-srg 13811 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |