Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mapdhval2 Structured version   Visualization version   GIF version

Theorem mapdhval2 36841
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
StepHypRef 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 }))
61, 2, 3, 4, 5mapdhval 36839 . 2 (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))))
7 eldifsni 4318 . . . 4 (𝑌 ∈ (𝑉 ∖ { 0 }) → 𝑌0 )
87neneqd 2798 . . 3 (𝑌 ∈ (𝑉 ∖ { 0 }) → ¬ 𝑌 = 0 )
9 iffalse 4093 . . 3 𝑌 = 0 → if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
105, 8, 93syl 18 . 2 (𝜑 → if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
116, 10eqtrd 2655 1 (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384   = wceq 1482  wcel 1989  Vcvv 3198  cdif 3569  ifcif 4084  {csn 4175  cotp 4183  cmpt 4727  cfv 5886  crio 6607  (class class class)co 6647  1st c1st 7163  2nd c2nd 7164  0gc0g 16094
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1721  ax-4 1736  ax-5 1838  ax-6 1887  ax-7 1934  ax-8 1991  ax-9 1998  ax-10 2018  ax-11 2033  ax-12 2046  ax-13 2245  ax-ext 2601  ax-sep 4779  ax-nul 4787  ax-pow 4841  ax-pr 4904  ax-un 6946
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1485  df-ex 1704  df-nf 1709  df-sb 1880  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2752  df-ne 2794  df-ral 2916  df-rex 2917  df-rab 2920  df-v 3200  df-sbc 3434  df-dif 3575  df-un 3577  df-in 3579  df-ss 3586  df-nul 3914  df-if 4085  df-sn 4176  df-pr 4178  df-op 4182  df-ot 4184  df-uni 4435  df-br 4652  df-opab 4711  df-mpt 4728  df-id 5022  df-xp 5118  df-rel 5119  df-cnv 5120  df-co 5121  df-dm 5122  df-rn 5123  df-iota 5849  df-fun 5888  df-fv 5894  df-riota 6608  df-ov 6650  df-1st 7165  df-2nd 7166
This theorem is referenced by:  mapdhcl  36842  mapdheq  36843
  Copyright terms: Public domain W3C validator