| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qusaddval | GIF version | ||
| Description: The addition 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 | ⊢ ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉) |
| qusaddf.p | ⊢ · = (+g‘𝑅) |
| qusaddf.a | ⊢ ∙ = (+g‘𝑈) |
| Ref | Expression |
|---|---|
| qusaddval | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ ) |
| 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 2234 | . 2 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) | |
| 8 | basfn 13355 | . . . . . . 7 ⊢ Base Fn V | |
| 9 | 4 | elexd 2829 | . . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ V) |
| 10 | funfvex 5692 | . . . . . . . 8 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V) | |
| 11 | 10 | funfni 5463 | . . . . . . 7 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V) |
| 12 | 8, 9, 11 | sylancr 414 | . . . . . 6 ⊢ (𝜑 → (Base‘𝑅) ∈ V) |
| 13 | 2, 12 | eqeltrd 2311 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ V) |
| 14 | erex 6804 | . . . . 5 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V)) | |
| 15 | 3, 13, 14 | sylc 62 | . . . 4 ⊢ (𝜑 → ∼ ∈ V) |
| 16 | 1, 2, 7, 15, 4 | qusval 13620 | . . 3 ⊢ (𝜑 → 𝑈 = ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅)) |
| 17 | 1, 2, 7, 15, 4 | quslem 13621 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ):𝑉–onto→(𝑉 / ∼ )) |
| 18 | qusaddf.p | . . 3 ⊢ · = (+g‘𝑅) | |
| 19 | qusaddf.a | . . 3 ⊢ ∙ = (+g‘𝑈) | |
| 20 | 16, 2, 17, 4, 18, 19 | imasplusg 13605 | . 2 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {〈〈((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘𝑝), ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘𝑞)〉, ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘(𝑝 · 𝑞))〉}) |
| 21 | plusgslid 13409 | . . . . 5 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 22 | 21 | slotex 13323 | . . . 4 ⊢ (𝑅 ∈ 𝑍 → (+g‘𝑅) ∈ V) |
| 23 | 4, 22 | syl 14 | . . 3 ⊢ (𝜑 → (+g‘𝑅) ∈ V) |
| 24 | 18, 23 | eqeltrid 2321 | . 2 ⊢ (𝜑 → · ∈ V) |
| 25 | 1, 2, 3, 4, 5, 6, 7, 20, 24 | qusaddvallemg 13630 | 1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 Vcvv 2815 class class class wbr 4114 ↦ cmpt 4176 Fn wfn 5352 ‘cfv 5357 (class class class)co 6058 Er wer 6777 [cec 6778 / cqs 6779 Basecbs 13296 +gcplusg 13374 /s cqus 13597 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-pre-ltirr 8255 ax-pre-ltadd 8259 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-tp 3702 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-ov 6061 df-oprab 6062 df-mpo 6063 df-er 6780 df-ec 6782 df-qs 6786 df-pnf 8326 df-mnf 8327 df-ltxr 8329 df-inn 9255 df-2 9313 df-3 9314 df-ndx 13299 df-slot 13300 df-base 13302 df-plusg 13387 df-mulr 13388 df-iimas 13599 df-qus 13600 |
| This theorem is referenced by: qusadd 14035 |
| Copyright terms: Public domain | W3C validator |