Theorem mapdhval2 42563

Description: Lemmma for ~? mapdh . (Contributed by NM, 3-Apr-2015.)

Hypotheses

Ref	Expression
mapdh.q	⊢ 𝑄 = (0g‘𝐶)
mapdh.i	⊢ 𝐼 = (𝑥 ∈ V ↦ if((2nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘𝑥)) − (2nd ‘𝑥))})) = (𝐽‘{((2nd ‘(1st ‘𝑥))𝑅ℎ)})))))
mapdh2.x	⊢ (𝜑 → 𝑋 ∈ 𝐴)
mapdh2.f	⊢ (𝜑 → 𝐹 ∈ 𝐵)
mapdh2.y	⊢ (𝜑 → 𝑌 ∈ (𝑉 ∖ { 0 }))

Assertion

Ref	Expression
mapdhval2	⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)}))))

Distinct variable groups:   𝑥,𝐷   𝑥,ℎ,𝐹   𝑥,𝐽   𝑥,𝑀   𝑥,𝑁   𝑥, 0   𝑥,𝑄   𝑥,𝑅   𝑥, −   ℎ,𝑋,𝑥   ℎ,𝑌,𝑥   𝜑,ℎ   0 ,ℎ

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥, ℎ)   𝐵(𝑥, ℎ)   𝐶(𝑥, ℎ)   𝐷(ℎ)   𝑄(ℎ)   𝑅(ℎ)   𝐼(𝑥, ℎ)   𝐽(ℎ)   𝑀(ℎ)   − (ℎ)   𝑁(ℎ)   𝑉(𝑥, ℎ)

Proof of Theorem 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 42561	. 2 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))))
7		eldifsni 4760	. . . 4 ⊢ (𝑌 ∈ (𝑉 ∖ { 0 }) → 𝑌 ≠ 0 )
8	7	neneqd 2965	. . 3 ⊢ (𝑌 ∈ (𝑉 ∖ { 0 }) → ¬ 𝑌 = 0 )
9		iffalse 4498	. . 3 ⊢ (¬ 𝑌 = 0 → if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)}))))
10	5, 8, 9	3syl 19	. 2 ⊢ (𝜑 → if(𝑌 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)})))) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)}))))
11	6, 10	eqtrd 2800	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 𝑌)})) = (𝐽‘{(𝐹𝑅ℎ)}))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3457   ∖ cdif 3903  ifcif 4489  {csn 4591  ⟨cotp 4599   ↦ cmpt 5194  ‘cfv 6541  ℩crio 7376  (class class class)co 7420  1^st c1st 7991  2^nd c2nd 7992  0_gc0g 17519

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7743

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-ot 4600  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6497  df-fun 6543  df-fv 6549  df-riota 7377  df-ov 7423  df-1st 7993  df-2nd 7994

This theorem is used by:  mapdhcl  42564  mapdheq  42565