![]() |
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 12679 | . . . . . . . 8 ⊢ Base Fn V | |
7 | elex 2771 | . . . . . . . 8 ⊢ (𝑅 ∈ 𝑍 → 𝑅 ∈ V) | |
8 | funfvex 5572 | . . . . . . . . 9 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V) | |
9 | 8 | funfni 5355 | . . . . . . . 8 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V) |
10 | 6, 7, 9 | sylancr 414 | . . . . . . 7 ⊢ (𝑅 ∈ 𝑍 → (Base‘𝑅) ∈ V) |
11 | 5, 10 | syl 14 | . . . . . 6 ⊢ (𝜑 → (Base‘𝑅) ∈ V) |
12 | 2, 11 | eqeltrd 2270 | . . . . 5 ⊢ (𝜑 → 𝑉 ∈ V) |
13 | erex 6613 | . . . . 5 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V)) | |
14 | 4, 12, 13 | sylc 62 | . . . 4 ⊢ (𝜑 → ∼ ∈ V) |
15 | 1, 2, 3, 14, 5 | quslem 12910 | . . 3 ⊢ (𝜑 → 𝐹:𝑉–onto→(𝑉 / ∼ )) |
16 | qusaddf.c | . . . 4 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉) | |
17 | qusaddf.e | . . . 4 ⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 · 𝑏) ∼ (𝑝 · 𝑞))) | |
18 | 4, 12, 3, 16, 17 | ercpbl 12917 | . . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (((𝐹‘𝑎) = (𝐹‘𝑝) ∧ (𝐹‘𝑏) = (𝐹‘𝑞)) → (𝐹‘(𝑎 · 𝑏)) = (𝐹‘(𝑝 · 𝑞)))) |
19 | qusaddflem.g | . . 3 ⊢ (𝜑 → ∙ = ∪ 𝑝 ∈ 𝑉 ∪ 𝑞 ∈ 𝑉 {〈〈(𝐹‘𝑝), (𝐹‘𝑞)〉, (𝐹‘(𝑝 · 𝑞))〉}) | |
20 | qusaddflemg.x | . . 3 ⊢ (𝜑 → · ∈ 𝑊) | |
21 | 15, 18, 19, 12, 20 | imasaddvallemg 12901 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝐹‘𝑋) ∙ (𝐹‘𝑌)) = (𝐹‘(𝑋 · 𝑌))) |
22 | 4 | 3ad2ant1 1020 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ∼ Er 𝑉) |
23 | 12 | 3ad2ant1 1020 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 𝑉 ∈ V) |
24 | simp2 1000 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 𝑋 ∈ 𝑉) | |
25 | 22, 23, 3, 24 | divsfvalg 12915 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝐹‘𝑋) = [𝑋] ∼ ) |
26 | simp3 1001 | . . . 4 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → 𝑌 ∈ 𝑉) | |
27 | 22, 23, 3, 26 | divsfvalg 12915 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝐹‘𝑌) = [𝑌] ∼ ) |
28 | 25, 27 | oveq12d 5937 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((𝐹‘𝑋) ∙ (𝐹‘𝑌)) = ([𝑋] ∼ ∙ [𝑌] ∼ )) |
29 | 16 | 3ad2antl1 1161 | . . . 4 ⊢ (((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → (𝑝 · 𝑞) ∈ 𝑉) |
30 | 29, 24, 26 | caovcld 6074 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 · 𝑌) ∈ 𝑉) |
31 | 22, 23, 3, 30 | divsfvalg 12915 | . 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝐹‘(𝑋 · 𝑌)) = [(𝑋 · 𝑌)] ∼ ) |
32 | 21, 28, 31 | 3eqtr3d 2234 | 1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋] ∼ ∙ [𝑌] ∼ ) = [(𝑋 · 𝑌)] ∼ ) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 Vcvv 2760 {csn 3619 〈cop 3622 ∪ ciun 3913 class class class wbr 4030 ↦ cmpt 4091 Fn wfn 5250 ‘cfv 5255 (class class class)co 5919 Er wer 6586 [cec 6587 / cqs 6588 Basecbs 12621 /s cqus 12886 |
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 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 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-cnex 7965 ax-resscn 7966 ax-1re 7968 ax-addrcl 7971 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-un 3158 df-in 3160 df-ss 3167 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-ov 5922 df-er 6589 df-ec 6591 df-qs 6595 df-inn 8985 df-ndx 12624 df-slot 12625 df-base 12627 |
This theorem is referenced by: qusaddval 12921 qusmulval 12923 |
Copyright terms: Public domain | W3C validator |