Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > mapdhval2 | Structured version Visualization version GIF version |
Description: Lemmma for ~? mapdh . (Contributed by NM, 3-Apr-2015.) |
Ref | Expression |
---|---|
mapdh.q | ⊢ 𝑄 = (0g‘𝐶) |
mapdh.i | ⊢ 𝐼 = (𝑥 ∈ V ↦ if((2nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘𝑥)) − (2nd ‘𝑥))})) = (𝐽‘{((2nd ‘(1st ‘𝑥))𝑅ℎ)}))))) |
mapdh2.x | ⊢ (𝜑 → 𝑋 ∈ 𝐴) |
mapdh2.f | ⊢ (𝜑 → 𝐹 ∈ 𝐵) |
mapdh2.y | ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 })) |
Ref | Expression |
---|---|
mapdhval2 | ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑌〉) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mapdh.q | . . 3 ⊢ 𝑄 = (0g‘𝐶) | |
2 | mapdh.i | . . 3 ⊢ 𝐼 = (𝑥 ∈ V ↦ if((2nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘𝑥)) − (2nd ‘𝑥))})) = (𝐽‘{((2nd ‘(1st ‘𝑥))𝑅ℎ)}))))) | |
3 | mapdh2.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐴) | |
4 | mapdh2.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
5 | mapdh2.y | . . 3 ⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 })) | |
6 | 1, 2, 3, 4, 5 | mapdhval 38854 | . 2 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑌〉) = if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)}))))) |
7 | eldifsni 4715 | . . . 4 ⊢ (𝑌 ∈ (𝑉 ∖ { 0 }) → 𝑌 ≠ 0 ) | |
8 | 7 | neneqd 3021 | . . 3 ⊢ (𝑌 ∈ (𝑉 ∖ { 0 }) → ¬ 𝑌 = 0 ) |
9 | iffalse 4475 | . . 3 ⊢ (¬ 𝑌 = 0 → if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) | |
10 | 5, 8, 9 | 3syl 18 | . 2 ⊢ (𝜑 → if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) |
11 | 6, 10 | eqtrd 2856 | 1 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑌〉) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 Vcvv 3494 ∖ cdif 3932 ifcif 4466 {csn 4560 〈cotp 4568 ↦ cmpt 5138 ‘cfv 6349 ℩crio 7107 (class class class)co 7150 1st c1st 7681 2nd c2nd 7682 0gc0g 16707 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-ot 4569 df-uni 4832 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-iota 6308 df-fun 6351 df-fv 6357 df-riota 7108 df-ov 7153 df-1st 7683 df-2nd 7684 |
This theorem is referenced by: mapdhcl 38857 mapdheq 38858 |
Copyright terms: Public domain | W3C validator |