| 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 2206 | . 2 ⊢ (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) | |
| 8 | basfn 12940 | . . . . . . 7 ⊢ Base Fn V | |
| 9 | 4 | elexd 2787 | . . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ V) |
| 10 | funfvex 5603 | . . . . . . . 8 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V) | |
| 11 | 10 | funfni 5382 | . . . . . . 7 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V) |
| 12 | 8, 9, 11 | sylancr 414 | . . . . . 6 ⊢ (𝜑 → (Base‘𝑅) ∈ V) |
| 13 | 2, 12 | eqeltrd 2283 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ V) |
| 14 | erex 6654 | . . . . 5 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V)) | |
| 15 | 3, 13, 14 | sylc 62 | . . . 4 ⊢ (𝜑 → ∼ ∈ V) |
| 16 | 1, 2, 7, 15, 4 | qusval 13205 | . . 3 ⊢ (𝜑 → 𝑈 = ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) “s 𝑅)) |
| 17 | 1, 2, 7, 15, 4 | quslem 13206 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ):𝑉–onto→(𝑉 / ∼ )) |
| 18 | qusaddf.p | . . 3 ⊢ · = (+g‘𝑅) | |
| 19 | qusaddf.a | . . 3 ⊢ ∙ = (+g‘𝑈) | |
| 20 | 16, 2, 17, 4, 18, 19 | imasplusg 13190 | . 2 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {〈〈((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘𝑝), ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘𝑞)〉, ((𝑥 ∈ 𝑉 ↦ [𝑥] ∼ )‘(𝑝 · 𝑞))〉}) |
| 21 | plusgslid 12994 | . . . . 5 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 22 | 21 | slotex 12909 | . . . 4 ⊢ (𝑅 ∈ 𝑍 → (+g‘𝑅) ∈ V) |
| 23 | 4, 22 | syl 14 | . . 3 ⊢ (𝜑 → (+g‘𝑅) ∈ V) |
| 24 | 18, 23 | eqeltrid 2293 | . 2 ⊢ (𝜑 → · ∈ V) |
| 25 | 1, 2, 3, 4, 5, 6, 7, 20, 24 | qusaddvallemg 13215 | 1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 981 = wceq 1373 ∈ wcel 2177 Vcvv 2773 class class class wbr 4048 ↦ cmpt 4110 Fn wfn 5272 ‘cfv 5277 (class class class)co 5954 Er wer 6627 [cec 6628 / cqs 6629 Basecbs 12882 +gcplusg 12959 /s cqus 13182 |
| 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-coll 4164 ax-sep 4167 ax-pow 4223 ax-pr 4258 ax-un 4485 ax-setind 4590 ax-cnex 8029 ax-resscn 8030 ax-1cn 8031 ax-1re 8032 ax-icn 8033 ax-addcl 8034 ax-addrcl 8035 ax-mulcl 8036 ax-addcom 8038 ax-addass 8040 ax-i2m1 8043 ax-0lt1 8044 ax-0id 8046 ax-rnegex 8047 ax-pre-ltirr 8050 ax-pre-ltadd 8054 |
| This theorem depends on definitions: df-bi 117 df-3or 982 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-reu 2492 df-rab 2494 df-v 2775 df-sbc 3001 df-csb 3096 df-dif 3170 df-un 3172 df-in 3174 df-ss 3181 df-nul 3463 df-pw 3620 df-sn 3641 df-pr 3642 df-tp 3643 df-op 3644 df-uni 3854 df-int 3889 df-iun 3932 df-br 4049 df-opab 4111 df-mpt 4112 df-id 4345 df-xp 4686 df-rel 4687 df-cnv 4688 df-co 4689 df-dm 4690 df-rn 4691 df-res 4692 df-ima 4693 df-iota 5238 df-fun 5279 df-fn 5280 df-f 5281 df-f1 5282 df-fo 5283 df-f1o 5284 df-fv 5285 df-ov 5957 df-oprab 5958 df-mpo 5959 df-er 6630 df-ec 6632 df-qs 6636 df-pnf 8122 df-mnf 8123 df-ltxr 8125 df-inn 9050 df-2 9108 df-3 9109 df-ndx 12885 df-slot 12886 df-base 12888 df-plusg 12972 df-mulr 12973 df-iimas 13184 df-qus 13185 |
| This theorem is referenced by: qusadd 13620 |
| Copyright terms: Public domain | W3C validator |