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 36031 | . 2 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑌〉) = if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)}))))) |
7 | eldifsni 4261 | . . . 4 ⊢ (𝑌 ∈ (𝑉 ∖ { 0 }) → 𝑌 ≠ 0 ) | |
8 | 7 | neneqd 2787 | . . 3 ⊢ (𝑌 ∈ (𝑉 ∖ { 0 }) → ¬ 𝑌 = 0 ) |
9 | iffalse 4045 | . . 3 ⊢ (¬ 𝑌 = 0 → if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) | |
10 | 5, 8, 9 | 3syl 18 | . 2 ⊢ (𝜑 → if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) |
11 | 6, 10 | eqtrd 2644 | 1 ⊢ (𝜑 → (𝐼‘〈𝑋, 𝐹, 𝑌〉) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 Vcvv 3173 ∖ cdif 3537 ifcif 4036 {csn 4125 〈cotp 4133 ↦ cmpt 4643 ‘cfv 5804 ℩crio 6510 (class class class)co 6549 1st c1st 7057 2nd c2nd 7058 0gc0g 15923 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-ot 4134 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-iota 5768 df-fun 5806 df-fv 5812 df-riota 6511 df-ov 6552 df-1st 7059 df-2nd 7060 |
This theorem is referenced by: mapdhcl 36034 mapdheq 36035 |
Copyright terms: Public domain | W3C validator |