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

Theorem mapdhval 36528
 Description: Lemmma for ~? mapdh . (Contributed by NM, 3-Apr-2015.) (Revised by Mario Carneiro, 6-May-2015.)
Hypotheses
Ref Expression
mapdh.q 𝑄 = (0g𝐶)
mapdh.i 𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))
mapdh.x (𝜑𝑋𝐴)
mapdh.f (𝜑𝐹𝐵)
mapdh.y (𝜑𝑌𝐸)
Assertion
Ref Expression
mapdhval (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))))
Distinct variable groups:   𝑥,𝐷   𝑥,,𝐹   𝑥,𝐽   𝑥,𝑀   𝑥,𝑁   𝑥, 0   𝑥,𝑄   𝑥,𝑅   𝑥,   ,𝑋,𝑥   ,𝑌,𝑥   𝜑,
Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥,)   𝐵(𝑥,)   𝐶(𝑥,)   𝐷()   𝑄()   𝑅()   𝐸(𝑥,)   𝐼(𝑥,)   𝐽()   𝑀()   ()   𝑁()   0 ()

Proof of Theorem mapdhval
StepHypRef Expression
1 otex 4899 . . 3 𝑋, 𝐹, 𝑌⟩ ∈ V
2 fveq2 6153 . . . . . 6 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (2nd𝑥) = (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))
32eqeq1d 2623 . . . . 5 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → ((2nd𝑥) = 0 ↔ (2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 0 ))
42sneqd 4165 . . . . . . . . . 10 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → {(2nd𝑥)} = {(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})
54fveq2d 6157 . . . . . . . . 9 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (𝑁‘{(2nd𝑥)}) = (𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)}))
65fveq2d 6157 . . . . . . . 8 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (𝑀‘(𝑁‘{(2nd𝑥)})) = (𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})))
76eqeq1d 2623 . . . . . . 7 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ↔ (𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{})))
8 fveq2 6153 . . . . . . . . . . . . 13 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (1st𝑥) = (1st ‘⟨𝑋, 𝐹, 𝑌⟩))
98fveq2d 6157 . . . . . . . . . . . 12 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (1st ‘(1st𝑥)) = (1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)))
109, 2oveq12d 6628 . . . . . . . . . . 11 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → ((1st ‘(1st𝑥)) (2nd𝑥)) = ((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩)))
1110sneqd 4165 . . . . . . . . . 10 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → {((1st ‘(1st𝑥)) (2nd𝑥))} = {((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})
1211fveq2d 6157 . . . . . . . . 9 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))}) = (𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))}))
1312fveq2d 6157 . . . . . . . 8 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})))
148fveq2d 6157 . . . . . . . . . . 11 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (2nd ‘(1st𝑥)) = (2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)))
1514oveq1d 6625 . . . . . . . . . 10 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → ((2nd ‘(1st𝑥))𝑅) = ((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅))
1615sneqd 4165 . . . . . . . . 9 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → {((2nd ‘(1st𝑥))𝑅)} = {((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)})
1716fveq2d 6157 . . . . . . . 8 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (𝐽‘{((2nd ‘(1st𝑥))𝑅)}) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)}))
1813, 17eqeq12d 2636 . . . . . . 7 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → ((𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)}) ↔ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)})))
197, 18anbi12d 746 . . . . . 6 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})) ↔ ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)}))))
2019riotabidv 6573 . . . . 5 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)}))) = (𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)}))))
213, 20ifbieq2d 4088 . . . 4 (𝑥 = ⟨𝑋, 𝐹, 𝑌⟩ → if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))) = if((2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)})))))
22 mapdh.i . . . 4 𝐼 = (𝑥 ∈ V ↦ if((2nd𝑥) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd𝑥)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st𝑥)) (2nd𝑥))})) = (𝐽‘{((2nd ‘(1st𝑥))𝑅)})))))
23 mapdh.q . . . . . 6 𝑄 = (0g𝐶)
24 fvex 6163 . . . . . 6 (0g𝐶) ∈ V
2523, 24eqeltri 2694 . . . . 5 𝑄 ∈ V
26 riotaex 6575 . . . . 5 (𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)}))) ∈ V
2725, 26ifex 4133 . . . 4 if((2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)})))) ∈ V
2821, 22, 27fvmpt 6244 . . 3 (⟨𝑋, 𝐹, 𝑌⟩ ∈ V → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if((2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)})))))
291, 28mp1i 13 . 2 (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if((2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)})))))
30 mapdh.y . . . . 5 (𝜑𝑌𝐸)
31 ot3rdg 7136 . . . . 5 (𝑌𝐸 → (2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 𝑌)
3230, 31syl 17 . . . 4 (𝜑 → (2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 𝑌)
3332eqeq1d 2623 . . 3 (𝜑 → ((2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 0𝑌 = 0 ))
3432sneqd 4165 . . . . . . . 8 (𝜑 → {(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)} = {𝑌})
3534fveq2d 6157 . . . . . . 7 (𝜑 → (𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)}) = (𝑁‘{𝑌}))
3635fveq2d 6157 . . . . . 6 (𝜑 → (𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝑀‘(𝑁‘{𝑌})))
3736eqeq1d 2623 . . . . 5 (𝜑 → ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ↔ (𝑀‘(𝑁‘{𝑌})) = (𝐽‘{})))
38 mapdh.x . . . . . . . . . . 11 (𝜑𝑋𝐴)
39 mapdh.f . . . . . . . . . . 11 (𝜑𝐹𝐵)
40 ot1stg 7134 . . . . . . . . . . 11 ((𝑋𝐴𝐹𝐵𝑌𝐸) → (1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) = 𝑋)
4138, 39, 30, 40syl3anc 1323 . . . . . . . . . 10 (𝜑 → (1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) = 𝑋)
4241, 32oveq12d 6628 . . . . . . . . 9 (𝜑 → ((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩)) = (𝑋 𝑌))
4342sneqd 4165 . . . . . . . 8 (𝜑 → {((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))} = {(𝑋 𝑌)})
4443fveq2d 6157 . . . . . . 7 (𝜑 → (𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))}) = (𝑁‘{(𝑋 𝑌)}))
4544fveq2d 6157 . . . . . 6 (𝜑 → (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝑀‘(𝑁‘{(𝑋 𝑌)})))
46 ot2ndg 7135 . . . . . . . . . 10 ((𝑋𝐴𝐹𝐵𝑌𝐸) → (2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) = 𝐹)
4738, 39, 30, 46syl3anc 1323 . . . . . . . . 9 (𝜑 → (2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) = 𝐹)
4847oveq1d 6625 . . . . . . . 8 (𝜑 → ((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅) = (𝐹𝑅))
4948sneqd 4165 . . . . . . 7 (𝜑 → {((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)} = {(𝐹𝑅)})
5049fveq2d 6157 . . . . . 6 (𝜑 → (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)}) = (𝐽‘{(𝐹𝑅)}))
5145, 50eqeq12d 2636 . . . . 5 (𝜑 → ((𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)}) ↔ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))
5237, 51anbi12d 746 . . . 4 (𝜑 → (((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)})) ↔ ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
5352riotabidv 6573 . . 3 (𝜑 → (𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)}))) = (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)}))))
5433, 53ifbieq2d 4088 . 2 (𝜑 → if((2nd ‘⟨𝑋, 𝐹, 𝑌⟩) = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{(2nd ‘⟨𝑋, 𝐹, 𝑌⟩)})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{((1st ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩)) (2nd ‘⟨𝑋, 𝐹, 𝑌⟩))})) = (𝐽‘{((2nd ‘(1st ‘⟨𝑋, 𝐹, 𝑌⟩))𝑅)})))) = if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))))
5529, 54eqtrd 2655 1 (𝜑 → (𝐼‘⟨𝑋, 𝐹, 𝑌⟩) = if(𝑌 = 0 , 𝑄, (𝐷 ((𝑀‘(𝑁‘{𝑌})) = (𝐽‘{}) ∧ (𝑀‘(𝑁‘{(𝑋 𝑌)})) = (𝐽‘{(𝐹𝑅)})))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384   = wceq 1480   ∈ wcel 1987  Vcvv 3189  ifcif 4063  {csn 4153  ⟨cotp 4161   ↦ cmpt 4678  ‘cfv 5852  ℩crio 6570  (class class class)co 6610  1st c1st 7118  2nd c2nd 7119  0gc0g 16032 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6909 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3191  df-sbc 3422  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-nul 3897  df-if 4064  df-sn 4154  df-pr 4156  df-op 4160  df-ot 4162  df-uni 4408  df-br 4619  df-opab 4679  df-mpt 4680  df-id 4994  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-iota 5815  df-fun 5854  df-fv 5860  df-riota 6571  df-ov 6613  df-1st 7120  df-2nd 7121 This theorem is referenced by:  mapdhval0  36529  mapdhval2  36530  hdmap1valc  36608
 Copyright terms: Public domain W3C validator