![]() |
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 2189 | . 2 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) | |
8 | basfn 12538 | . . . . . . 7 ⊢ Base Fn V | |
9 | 4 | elexd 2765 | . . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ V) |
10 | funfvex 5547 | . . . . . . . 8 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V) | |
11 | 10 | funfni 5331 | . . . . . . 7 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V) |
12 | 8, 9, 11 | sylancr 414 | . . . . . 6 ⊢ (𝜑 → (Base‘𝑅) ∈ V) |
13 | 2, 12 | eqeltrd 2266 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ V) |
14 | erex 6577 | . . . . 5 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V)) | |
15 | 3, 13, 14 | sylc 62 | . . . 4 ⊢ (𝜑 → ∼ ∈ V) |
16 | 1, 2, 7, 15, 4 | qusval 12766 | . . 3 ⊢ (𝜑 → 𝑈 = ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅)) |
17 | 1, 2, 7, 15, 4 | quslem 12767 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ):𝑉–onto→(𝑉 / ∼ )) |
18 | qusaddf.p | . . 3 ⊢ · = (+g‘𝑅) | |
19 | qusaddf.a | . . 3 ⊢ ∙ = (+g‘𝑈) | |
20 | 16, 2, 17, 4, 18, 19 | imasplusg 12751 | . 2 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {〈〈((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘𝑝), ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘𝑞)〉, ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘(𝑝 · 𝑞))〉}) |
21 | plusgslid 12590 | . . . . 5 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
22 | 21 | slotex 12507 | . . . 4 ⊢ (𝑅 ∈ 𝑍 → (+g‘𝑅) ∈ V) |
23 | 4, 22 | syl 14 | . . 3 ⊢ (𝜑 → (+g‘𝑅) ∈ V) |
24 | 18, 23 | eqeltrid 2276 | . 2 ⊢ (𝜑 → · ∈ V) |
25 | 1, 2, 3, 4, 5, 6, 7, 20, 24 | qusaddvallemg 12775 | 1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ ) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2160 Vcvv 2752 class class class wbr 4018 ↦ cmpt 4079 Fn wfn 5226 ‘cfv 5231 (class class class)co 5891 Er wer 6550 [cec 6551 / cqs 6552 Basecbs 12480 +gcplusg 12555 /s cqus 12743 |
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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-pow 4189 ax-pr 4224 ax-un 4448 ax-setind 4551 ax-cnex 7920 ax-resscn 7921 ax-1cn 7922 ax-1re 7923 ax-icn 7924 ax-addcl 7925 ax-addrcl 7926 ax-mulcl 7927 ax-addcom 7929 ax-addass 7931 ax-i2m1 7934 ax-0lt1 7935 ax-0id 7937 ax-rnegex 7938 ax-pre-ltirr 7941 ax-pre-ltadd 7945 |
This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3592 df-sn 3613 df-pr 3614 df-tp 3615 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4308 df-xp 4647 df-rel 4648 df-cnv 4649 df-co 4650 df-dm 4651 df-rn 4652 df-res 4653 df-ima 4654 df-iota 5193 df-fun 5233 df-fn 5234 df-f 5235 df-f1 5236 df-fo 5237 df-f1o 5238 df-fv 5239 df-ov 5894 df-oprab 5895 df-mpo 5896 df-er 6553 df-ec 6555 df-qs 6559 df-pnf 8012 df-mnf 8013 df-ltxr 8015 df-inn 8938 df-2 8996 df-3 8997 df-ndx 12483 df-slot 12484 df-base 12486 df-plusg 12568 df-mulr 12569 df-iimas 12745 df-qus 12746 |
This theorem is referenced by: qusadd 13139 |
Copyright terms: Public domain | W3C validator |