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 37529
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 37527 . 2 (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))))
7 eldifsni 4455 . . . 4 (𝑌 ∈ (𝑉 ∖ { 0 }) → 𝑌0 )
87neneqd 2947 . . 3 (𝑌 ∈ (𝑉 ∖ { 0 }) → ¬ 𝑌 = 0 )
9 iffalse 4232 . . 3 𝑌 = 0 → if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
105, 8, 93syl 18 . 2 (𝜑 → if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
116, 10eqtrd 2804 1 (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 382   = wceq 1630  wcel 2144  Vcvv 3349  cdif 3718  ifcif 4223  {csn 4314  cotp 4322  cmpt 4861  cfv 6031  crio 6752  (class class class)co 6792  1st c1st 7312  2nd c2nd 7313  0gc0g 16307
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-sep 4912  ax-nul 4920  ax-pow 4971  ax-pr 5034  ax-un 7095
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-ral 3065  df-rex 3066  df-rab 3069  df-v 3351  df-sbc 3586  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-nul 4062  df-if 4224  df-sn 4315  df-pr 4317  df-op 4321  df-ot 4323  df-uni 4573  df-br 4785  df-opab 4845  df-mpt 4862  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-iota 5994  df-fun 6033  df-fv 6039  df-riota 6753  df-ov 6795  df-1st 7314  df-2nd 7315
This theorem is referenced by:  mapdhcl  37530  mapdheq  37531
  Copyright terms: Public domain W3C validator