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 38980
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 38978 . 2 (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))))
7 eldifsni 4696 . . . 4 (𝑌 ∈ (𝑉 ∖ { 0 }) → 𝑌0 )
87neneqd 3016 . . 3 (𝑌 ∈ (𝑉 ∖ { 0 }) → ¬ 𝑌 = 0 )
9 iffalse 4448 . . 3 𝑌 = 0 → if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
105, 8, 93syl 18 . 2 (𝜑 → if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
116, 10eqtrd 2857 1 (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 399   = wceq 1538  wcel 2114  Vcvv 3469  cdif 3905  ifcif 4439  {csn 4539  cotp 4547  cmpt 5122  cfv 6334  crio 7097  (class class class)co 7140  1st c1st 7673  2nd c2nd 7674  0gc0g 16704
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2178  ax-ext 2794  ax-sep 5179  ax-nul 5186  ax-pow 5243  ax-pr 5307  ax-un 7446
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2801  df-cleq 2815  df-clel 2894  df-nfc 2962  df-ne 3012  df-ral 3135  df-rex 3136  df-rab 3139  df-v 3471  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4266  df-if 4440  df-sn 4540  df-pr 4542  df-op 4546  df-ot 4548  df-uni 4814  df-br 5043  df-opab 5105  df-mpt 5123  df-id 5437  df-xp 5538  df-rel 5539  df-cnv 5540  df-co 5541  df-dm 5542  df-rn 5543  df-iota 6293  df-fun 6336  df-fv 6342  df-riota 7098  df-ov 7143  df-1st 7675  df-2nd 7676
This theorem is referenced by:  mapdhcl  38981  mapdheq  38982
  Copyright terms: Public domain W3C validator