| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qusaddvallemg | GIF version | ||
| Description: Value of an operation defined on 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 | ⊢ ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉) |
| qusaddflem.f | ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) |
| qusaddflem.g | ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {〈〈(𝐹‘𝑝), (𝐹‘𝑞)〉, (𝐹‘(𝑝 · 𝑞))〉}) |
| qusaddflemg.x | ⊢ (𝜑 → · ∈ 𝑊) |
| Ref | Expression |
|---|---|
| qusaddvallemg | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qusaddf.u | . . . 4 ⊢ (𝜑 → 𝑈 = (𝑅 /s ∼ )) | |
| 2 | qusaddf.v | . . . 4 ⊢ (𝜑 → 𝑉 = (Base‘𝑅)) | |
| 3 | qusaddflem.f | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ [𝑥] ∼ ) | |
| 4 | qusaddf.r | . . . . 5 ⊢ (𝜑 → ∼ Er 𝑉) | |
| 5 | qusaddf.z | . . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ 𝑍) | |
| 6 | basfn 13389 | . . . . . . . 8 ⊢ Base Fn V | |
| 7 | elex 2833 | . . . . . . . 8 ⊢ (𝑅 ∈ 𝑍 → 𝑅 ∈ V) | |
| 8 | funfvex 5707 | . . . . . . . . 9 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V) | |
| 9 | 8 | funfni 5478 | . . . . . . . 8 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V) |
| 10 | 6, 7, 9 | sylancr 418 | . . . . . . 7 ⊢ (𝑅 ∈ 𝑍 → (Base‘𝑅) ∈ V) |
| 11 | 5, 10 | syl 14 | . . . . . 6 ⊢ (𝜑 → (Base‘𝑅) ∈ V) |
| 12 | 2, 11 | eqeltrd 2315 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ V) |
| 13 | erex 6821 | . . . . 5 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V)) | |
| 14 | 4, 12, 13 | sylc 62 | . . . 4 ⊢ (𝜑 → ∼ ∈ V) |
| 15 | 1, 2, 3, 14, 5 | quslem 13622 | . . 3 ⊢ (𝜑 → 𝐹:𝑉–onto→(𝑉 / ∼ )) |
| 16 | qusaddf.c | . . . 4 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉) | |
| 17 | qusaddf.e | . . . 4 ⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 · 𝑏) ∼ (𝑝 · 𝑞))) | |
| 18 | 4, 12, 3, 16, 17 | ercpbl 13629 | . . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑝 · 𝑞)))) |
| 19 | qusaddflem.g | . . 3 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {〈〈(𝐹‘𝑝), (𝐹‘𝑞)〉, (𝐹‘(𝑝 · 𝑞))〉}) | |
| 20 | qusaddflemg.x | . . 3 ⊢ (𝜑 → · ∈ 𝑊) | |
| 21 | 15, 18, 19, 12, 20 | imasaddvallemg 13613 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝐹‘𝑋) ∙ (𝐹‘𝑌)) = (𝐹‘(𝑋 · 𝑌))) |
| 22 | 4 | 3ad2ant1 1049 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ∼ Er 𝑉) |
| 23 | 12 | 3ad2ant1 1049 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 𝑉 ∈ V) |
| 24 | simp2 1029 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 𝑋 ∈ 𝑉) | |
| 25 | 22, 23, 3, 24 | divsfvalg 13627 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝐹‘𝑋) = [𝑋] ∼ ) |
| 26 | simp3 1030 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 𝑌 ∈ 𝑉) | |
| 27 | 22, 23, 3, 26 | divsfvalg 13627 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝐹‘𝑌) = [𝑌] ∼ ) |
| 28 | 25, 27 | oveq12d 6093 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝐹‘𝑋) ∙ (𝐹‘𝑌)) = ([𝑋] ∼ ∙ [𝑌] ∼ )) |
| 29 | 16 | 3ad2antl1 1190 | . . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉) |
| 30 | 29, 24, 26 | caovcld 6233 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 · 𝑌) ∈ 𝑉) |
| 31 | 22, 23, 3, 30 | divsfvalg 13627 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝐹‘(𝑋 · 𝑌)) = [(𝑋 · 𝑌)] ∼ ) |
| 32 | 21, 28, 31 | 3eqtr3d 2279 | 1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 Vcvv 2821 {csn 3705 〈cop 3708 ∪ ciun 4007 class class class wbr 4125 ↦ cmpt 4187 Fn wfn 5367 ‘cfv 5372 (class class class)co 6075 Er wer 6794 [cec 6795 / cqs 6796 Basecbs 13330 /s cqus 13600 |
| 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-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 4241 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-cnex 8260 ax-resscn 8261 ax-1re 8263 ax-addrcl 8266 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 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-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-ov 6078 df-er 6797 df-ec 6799 df-qs 6803 df-inn 9284 df-ndx 13333 df-slot 13334 df-base 13336 |
| This theorem is referenced by: qusaddval 13633 qusmulval 13635 |
| Copyright terms: Public domain | W3C validator |