![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > qusaddf | GIF version |
Description: The addition in a quotient structure as a function. (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 |
---|---|
qusaddf | ⊢ (𝜑 → ∙ :((𝑉 / ∼ ) × (𝑉 / ∼ ))⟶(𝑉 / ∼ )) |
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 2187 | . 2 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) | |
8 | basfn 12534 | . . . . . . 7 ⊢ Base Fn V | |
9 | 4 | elexd 2762 | . . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ V) |
10 | funfvex 5544 | . . . . . . . 8 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V) | |
11 | 10 | funfni 5328 | . . . . . . 7 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V) |
12 | 8, 9, 11 | sylancr 414 | . . . . . 6 ⊢ (𝜑 → (Base‘𝑅) ∈ V) |
13 | 2, 12 | eqeltrd 2264 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ V) |
14 | erex 6573 | . . . . 5 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V)) | |
15 | 3, 13, 14 | sylc 62 | . . . 4 ⊢ (𝜑 → ∼ ∈ V) |
16 | 1, 2, 7, 15, 4 | qusval 12762 | . . 3 ⊢ (𝜑 → 𝑈 = ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅)) |
17 | 1, 2, 7, 15, 4 | quslem 12763 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ):𝑉–onto→(𝑉 / ∼ )) |
18 | qusaddf.p | . . 3 ⊢ · = (+g‘𝑅) | |
19 | qusaddf.a | . . 3 ⊢ ∙ = (+g‘𝑈) | |
20 | 16, 2, 17, 4, 18, 19 | imasplusg 12747 | . 2 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {〈〈((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘𝑝), ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘𝑞)〉, ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘(𝑝 · 𝑞))〉}) |
21 | plusgslid 12586 | . . . . 5 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
22 | 21 | slotex 12503 | . . . 4 ⊢ (𝑅 ∈ 𝑍 → (+g‘𝑅) ∈ V) |
23 | 4, 22 | syl 14 | . . 3 ⊢ (𝜑 → (+g‘𝑅) ∈ V) |
24 | 18, 23 | eqeltrid 2274 | . 2 ⊢ (𝜑 → · ∈ V) |
25 | 1, 2, 3, 4, 5, 6, 7, 20, 24 | qusaddflemg 12772 | 1 ⊢ (𝜑 → ∙ :((𝑉 / ∼ ) × (𝑉 / ∼ ))⟶(𝑉 / ∼ )) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1363 ∈ wcel 2158 Vcvv 2749 class class class wbr 4015 ↦ cmpt 4076 × cxp 4636 Fn wfn 5223 ⟶wf 5224 ‘cfv 5228 (class class class)co 5888 Er wer 6546 [cec 6547 / cqs 6548 Basecbs 12476 +gcplusg 12551 /s cqus 12739 |
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 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2160 ax-14 2161 ax-ext 2169 ax-coll 4130 ax-sep 4133 ax-pow 4186 ax-pr 4221 ax-un 4445 ax-setind 4548 ax-cnex 7916 ax-resscn 7917 ax-1cn 7918 ax-1re 7919 ax-icn 7920 ax-addcl 7921 ax-addrcl 7922 ax-mulcl 7923 ax-addcom 7925 ax-addass 7927 ax-i2m1 7930 ax-0lt1 7931 ax-0id 7933 ax-rnegex 7934 ax-pre-ltirr 7937 ax-pre-ltadd 7941 |
This theorem depends on definitions: df-bi 117 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2039 df-mo 2040 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ne 2358 df-nel 2453 df-ral 2470 df-rex 2471 df-reu 2472 df-rab 2474 df-v 2751 df-sbc 2975 df-csb 3070 df-dif 3143 df-un 3145 df-in 3147 df-ss 3154 df-nul 3435 df-pw 3589 df-sn 3610 df-pr 3611 df-tp 3612 df-op 3613 df-uni 3822 df-int 3857 df-iun 3900 df-br 4016 df-opab 4077 df-mpt 4078 df-id 4305 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-rn 4649 df-res 4650 df-ima 4651 df-iota 5190 df-fun 5230 df-fn 5231 df-f 5232 df-f1 5233 df-fo 5234 df-f1o 5235 df-fv 5236 df-ov 5891 df-oprab 5892 df-mpo 5893 df-er 6549 df-ec 6551 df-qs 6555 df-pnf 8008 df-mnf 8009 df-ltxr 8011 df-inn 8934 df-2 8992 df-3 8993 df-ndx 12479 df-slot 12480 df-base 12482 df-plusg 12564 df-mulr 12565 df-iimas 12741 df-qus 12742 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |