| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qusmulval | GIF version | ||
| Description: The multiplication in a quotient structure. (Contributed by Mario Carneiro, 24-Feb-2015.) |
| Ref | Expression |
|---|---|
| qusaddf.u | ⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ )) |
| qusaddf.v | ⊢ (𝜑 → 𝑉 = (Base‘𝑅)) |
| qusaddf.r | ⊢ (𝜑 → ∼ Er 𝑉) |
| qusaddf.z | ⊢ (𝜑 → 𝑅 ∈ 𝑍) |
| qusaddf.e | ⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 · 𝑏) ∼ (𝑝 · 𝑞))) |
| qusaddf.c | ⊢ ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉) |
| qusmulf.p | ⊢ · = (.r‘𝑅) |
| qusmulf.a | ⊢ ∙ = (.r‘𝑈) |
| Ref | Expression |
|---|---|
| qusmulval | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qusaddf.u | . 2 ⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ )) | |
| 2 | qusaddf.v | . 2 ⊢ (𝜑 → 𝑉 = (Base‘𝑅)) | |
| 3 | qusaddf.r | . 2 ⊢ (𝜑 → ∼ Er 𝑉) | |
| 4 | qusaddf.z | . 2 ⊢ (𝜑 → 𝑅 ∈ 𝑍) | |
| 5 | qusaddf.e | . 2 ⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 · 𝑏) ∼ (𝑝 · 𝑞))) | |
| 6 | qusaddf.c | . 2 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉) | |
| 7 | eqid 2238 | . 2 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) | |
| 8 | basfn 13394 | . . . . . . 7 ⊢ Base Fn V | |
| 9 | 4 | elexd 2835 | . . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ V) |
| 10 | funfvex 5710 | . . . . . . . 8 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V) | |
| 11 | 10 | funfni 5481 | . . . . . . 7 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V) |
| 12 | 8, 9, 11 | sylancr 418 | . . . . . 6 ⊢ (𝜑 → (Base‘𝑅) ∈ V) |
| 13 | 2, 12 | eqeltrd 2315 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ V) |
| 14 | erex 6825 | . . . . 5 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V)) | |
| 15 | 3, 13, 14 | sylc 62 | . . . 4 ⊢ (𝜑 → ∼ ∈ V) |
| 16 | 1, 2, 7, 15, 4 | qusval 13627 | . . 3 ⊢ (𝜑 → 𝑈 = ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅)) |
| 17 | 1, 2, 7, 15, 4 | quslem 13628 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ):𝑉–onto→(𝑉 / ∼ )) |
| 18 | qusmulf.p | . . 3 ⊢ · = (.r‘𝑅) | |
| 19 | qusmulf.a | . . 3 ⊢ ∙ = (.r‘𝑈) | |
| 20 | 16, 2, 17, 4, 18, 19 | imasmulr 13613 | . 2 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {〈〈((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘𝑝), ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘𝑞)〉, ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘(𝑝 · 𝑞))〉}) |
| 21 | mulrslid 13469 | . . . . 5 ⊢ (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ) | |
| 22 | 21 | slotex 13362 | . . . 4 ⊢ (𝑅 ∈ 𝑍 → (.r‘𝑅) ∈ V) |
| 23 | 4, 22 | syl 14 | . . 3 ⊢ (𝜑 → (.r‘𝑅) ∈ V) |
| 24 | 18, 23 | eqeltrid 2325 | . 2 ⊢ (𝜑 → · ∈ V) |
| 25 | 1, 2, 3, 4, 5, 6, 7, 20, 24 | qusaddvallemg 13637 | 1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 Vcvv 2821 class class class wbr 4128 ↦ cmpt 4190 Fn wfn 5370 ‘cfv 5375 (class class class)co 6079 Er wer 6798 [cec 6799 / cqs 6800 Basecbs 13335 .rcmulr 13415 /s cqus 13606 |
| 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 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 4244 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-i2m1 8278 ax-0lt1 8279 ax-0id 8281 ax-rnegex 8282 ax-pre-ltirr 8285 ax-pre-lttrn 8287 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 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-nel 2516 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-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-tp 3716 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-ov 6082 df-oprab 6083 df-mpo 6084 df-er 6801 df-ec 6803 df-qs 6807 df-pnf 8356 df-mnf 8357 df-ltxr 8359 df-inn 9288 df-2 9346 df-3 9347 df-ndx 13338 df-slot 13339 df-base 13341 df-plusg 13427 df-mulr 13428 df-iimas 13607 df-qus 13608 |
| This theorem is referenced by: qusrhm 14848 qusmul2 14849 qusmulrng 14852 |
| Copyright terms: Public domain | W3C validator |