| 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 41726 | . 2 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑌〉) = if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)}))))) |
| 7 | eldifsni 4790 | . . . 4 ⊢ (𝑌 ∈ (𝑉 ∖ { 0 }) → 𝑌 ≠ 0 ) | |
| 8 | 7 | neneqd 2945 | . . 3 ⊢ (𝑌 ∈ (𝑉 ∖ { 0 }) → ¬ 𝑌 = 0 ) |
| 9 | iffalse 4534 | . . 3 ⊢ (¬ 𝑌 = 0 → if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) | |
| 10 | 5, 8, 9 | 3syl 18 | . 2 ⊢ (𝜑 → if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) |
| 11 | 6, 10 | eqtrd 2777 | 1 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑌〉) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 Vcvv 3480 ∖ cdif 3948 ifcif 4525 {csn 4626 〈cotp 4634 ↦ cmpt 5225 ‘cfv 6561 ℩crio 7387 (class class class)co 7431 1st c1st 8012 2nd c2nd 8013 0gc0g 17484 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pr 5432 ax-un 7755 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-ot 4635 df-uni 4908 df-br 5144 df-opab 5206 df-mpt 5226 df-id 5578 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-iota 6514 df-fun 6563 df-fv 6569 df-riota 7388 df-ov 7434 df-1st 8014 df-2nd 8015 |
| This theorem is referenced by: mapdhcl 41729 mapdheq 41730 |
| Copyright terms: Public domain | W3C validator |