mapdhval0 - Mathbox for Norm Megill

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

Theorem mapdhval0 41198

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

**Hypotheses**
Ref	Expression
mapdh.q	⊢ 𝑄 = (0_g‘𝐶)
mapdh.i	⊢ 𝐼 = (𝑥 ∈ V ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))
mapdh0.o	⊢ 0 = (0_g‘𝑈)
mapdh0.x	⊢ (𝜑 → 𝑋 ∈ 𝐴)
mapdh0.f	⊢ (𝜑 → 𝐹 ∈ 𝐵)

**Assertion**
Ref	Expression
mapdhval0	⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 0 ⟩) = 𝑄)

Distinct variable groups: 𝑥,𝐷 𝑥,ℎ,𝐹 𝑥,𝐽 𝑥,𝑀 𝑥,𝑁 𝑥, 0 𝑥,𝑄 𝑥,𝑅 𝑥, − ℎ,𝑋,𝑥 𝜑,ℎ 0 ,ℎ Allowed substitution hints: 𝜑(𝑥) 𝐴(𝑥,ℎ) 𝐵(𝑥,ℎ) 𝐶(𝑥,ℎ) 𝐷(ℎ) 𝑄(ℎ) 𝑅(ℎ) 𝑈(𝑥,ℎ) 𝐼(𝑥,ℎ) 𝐽(ℎ) 𝑀(ℎ) − (ℎ) 𝑁(ℎ)

**Proof of Theorem mapdhval0**
Step	Hyp	Ref	Expression
1		mapdh.q	. . 3 ⊢ 𝑄 = (0_g‘𝐶)
2		mapdh.i	. . 3 ⊢ 𝐼 = (𝑥 ∈ V ↦ if((2^nd ‘𝑥) = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{(2^nd ‘𝑥)})) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{((1^st ‘(1^st ‘𝑥)) − (2^nd ‘𝑥))})) = (𝐽‘{((2^nd ‘(1^st ‘𝑥))𝑅ℎ)})))))
3		mapdh0.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
4		mapdh0.f	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐵)
5		mapdh0.o	. . . . 5 ⊢ 0 = (0_g‘𝑈)
6	5	fvexi 6911	. . . 4 ⊢ 0 ∈ V
7	6	a1i 11	. . 3 ⊢ (𝜑 → 0 ∈ V)
8	1, 2, 3, 4, 7	mapdhval 41197	. 2 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 0 ⟩) = if( 0 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{ 0 })) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 0 )})) = (𝐽‘{(𝐹𝑅ℎ)})))))
9		eqid 2728	. . 3 ⊢ 0 = 0
10	9	iftruei 4536	. 2 ⊢ if( 0 = 0 , 𝑄, (℩ℎ ∈ 𝐷 ((𝑀‘(𝑁‘{ 0 })) = (𝐽‘{ℎ}) ∧ (𝑀‘(𝑁‘{(𝑋 − 0 )})) = (𝐽‘{(𝐹𝑅ℎ)})))) = 𝑄
11	8, 10	eqtrdi 2784	1 ⊢ (𝜑 → (𝐼‘⟨𝑋, 𝐹, 0 ⟩) = 𝑄)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 Vcvv 3471 ifcif 4529 {csn 4629 ⟨cotp 4637 ↦ cmpt 5231 ‘cfv 6548 ℩crio 7375 (class class class)co 7420 1^st c1st 7991 2^nd c2nd 7992 0_gc0g 17421

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pr 5429 ax-un 7740

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-rab 3430 df-v 3473 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-ot 4638 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-iota 6500 df-fun 6550 df-fv 6556 df-riota 7376 df-ov 7423 df-1st 7993 df-2nd 7994

This theorem is referenced by: mapdhcl 41200 mapdh6bN 41210 mapdh6cN 41211 mapdh6dN 41212 mapdh8 41261

W3C validator