prdsidlem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > prdsidlem		Structured version Visualization version GIF version

Theorem prdsidlem 18659

Description: Characterization of identity in a structure product. (Contributed by Mario Carneiro, 10-Jan-2015.)

**Hypotheses**
Ref	Expression
prdsplusgcl.y	⊢ 𝑌 = (𝑆X_s𝑅)
prdsplusgcl.b	⊢ 𝐵 = (Base‘𝑌)
prdsplusgcl.p	⊢ + = (+_g‘𝑌)
prdsplusgcl.s	⊢ (𝜑 → 𝑆 ∈ 𝑉)
prdsplusgcl.i	⊢ (𝜑 → 𝐼 ∈ 𝑊)
prdsplusgcl.r	⊢ (𝜑 → 𝑅:𝐼⟶Mnd)
prdsidlem.z	⊢ 0 = (0_g ∘ 𝑅)

**Assertion**
Ref	Expression
prdsidlem	⊢ (𝜑 → ( 0 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥)))

Distinct variable groups: 𝑥, + 𝑥,𝐵 𝑥,𝐼 𝑥,𝑅 𝜑,𝑥 𝑥,𝑆 𝑥,𝑉 𝑥,𝑊 𝑥,𝑌 Allowed substitution hint: 0 (𝑥)

Proof of Theorem prdsidlem Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prdsidlem.z	. . . 4 ⊢ 0 = (0_g ∘ 𝑅)
2		fvexd 6906	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ V)
3		prdsplusgcl.r	. . . . . 6 ⊢ (𝜑 → 𝑅:𝐼⟶Mnd)
4	3	feqmptd 6960	. . . . 5 ⊢ (𝜑 → 𝑅 = (𝑦 ∈ 𝐼 ↦ (𝑅‘𝑦)))
5		fn0g 18584	. . . . . . 7 ⊢ 0_g Fn V
6	5	a1i 11	. . . . . 6 ⊢ (𝜑 → 0_g Fn V)
7		dffn5 6950	. . . . . 6 ⊢ (0_g Fn V ↔ 0_g = (𝑥 ∈ V ↦ (0_g‘𝑥)))
8	6, 7	sylib 217	. . . . 5 ⊢ (𝜑 → 0_g = (𝑥 ∈ V ↦ (0_g‘𝑥)))
9		fveq2 6891	. . . . 5 ⊢ (𝑥 = (𝑅‘𝑦) → (0_g‘𝑥) = (0_g‘(𝑅‘𝑦)))
10	2, 4, 8, 9	fmptco 7129	. . . 4 ⊢ (𝜑 → (0_g ∘ 𝑅) = (𝑦 ∈ 𝐼 ↦ (0_g‘(𝑅‘𝑦))))
11	1, 10	eqtrid 2784	. . 3 ⊢ (𝜑 → 0 = (𝑦 ∈ 𝐼 ↦ (0_g‘(𝑅‘𝑦))))
12	3	ffvelcdmda 7086	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ Mnd)
13		eqid 2732	. . . . . . 7 ⊢ (Base‘(𝑅‘𝑦)) = (Base‘(𝑅‘𝑦))
14		eqid 2732	. . . . . . 7 ⊢ (0_g‘(𝑅‘𝑦)) = (0_g‘(𝑅‘𝑦))
15	13, 14	mndidcl 18642	. . . . . 6 ⊢ ((𝑅‘𝑦) ∈ Mnd → (0_g‘(𝑅‘𝑦)) ∈ (Base‘(𝑅‘𝑦)))
16	12, 15	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → (0_g‘(𝑅‘𝑦)) ∈ (Base‘(𝑅‘𝑦)))
17	16	ralrimiva 3146	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝐼 (0_g‘(𝑅‘𝑦)) ∈ (Base‘(𝑅‘𝑦)))
18		prdsplusgcl.y	. . . . 5 ⊢ 𝑌 = (𝑆X_s𝑅)
19		prdsplusgcl.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑌)
20		prdsplusgcl.s	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ 𝑉)
21		prdsplusgcl.i	. . . . 5 ⊢ (𝜑 → 𝐼 ∈ 𝑊)
22	3	ffnd 6718	. . . . 5 ⊢ (𝜑 → 𝑅 Fn 𝐼)
23	18, 19, 20, 21, 22	prdsbasmpt 17418	. . . 4 ⊢ (𝜑 → ((𝑦 ∈ 𝐼 ↦ (0_g‘(𝑅‘𝑦))) ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐼 (0_g‘(𝑅‘𝑦)) ∈ (Base‘(𝑅‘𝑦))))
24	17, 23	mpbird 256	. . 3 ⊢ (𝜑 → (𝑦 ∈ 𝐼 ↦ (0_g‘(𝑅‘𝑦))) ∈ 𝐵)
25	11, 24	eqeltrd 2833	. 2 ⊢ (𝜑 → 0 ∈ 𝐵)
26	1	fveq1i 6892	. . . . . . . . . 10 ⊢ ( 0 ‘𝑦) = ((0_g ∘ 𝑅)‘𝑦)
27		fvco2 6988	. . . . . . . . . . 11 ⊢ ((𝑅 Fn 𝐼 ∧ 𝑦 ∈ 𝐼) → ((0_g ∘ 𝑅)‘𝑦) = (0_g‘(𝑅‘𝑦)))
28	22, 27	sylan 580	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ((0_g ∘ 𝑅)‘𝑦) = (0_g‘(𝑅‘𝑦)))
29	26, 28	eqtrid 2784	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐼) → ( 0 ‘𝑦) = (0_g‘(𝑅‘𝑦)))
30	29	adantlr 713	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → ( 0 ‘𝑦) = (0_g‘(𝑅‘𝑦)))
31	30	oveq1d 7426	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → (( 0 ‘𝑦)(+_g‘(𝑅‘𝑦))(𝑥‘𝑦)) = ((0_g‘(𝑅‘𝑦))(+_g‘(𝑅‘𝑦))(𝑥‘𝑦)))
32	3	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑅:𝐼⟶Mnd)
33	32	ffvelcdmda 7086	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → (𝑅‘𝑦) ∈ Mnd)
34	20	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → 𝑆 ∈ 𝑉)
35	21	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → 𝐼 ∈ 𝑊)
36	22	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → 𝑅 Fn 𝐼)
37		simplr 767	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → 𝑥 ∈ 𝐵)
38		simpr 485	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → 𝑦 ∈ 𝐼)
39	18, 19, 34, 35, 36, 37, 38	prdsbasprj 17420	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → (𝑥‘𝑦) ∈ (Base‘(𝑅‘𝑦)))
40		eqid 2732	. . . . . . . . 9 ⊢ (+_g‘(𝑅‘𝑦)) = (+_g‘(𝑅‘𝑦))
41	13, 40, 14	mndlid 18647	. . . . . . . 8 ⊢ (((𝑅‘𝑦) ∈ Mnd ∧ (𝑥‘𝑦) ∈ (Base‘(𝑅‘𝑦))) → ((0_g‘(𝑅‘𝑦))(+_g‘(𝑅‘𝑦))(𝑥‘𝑦)) = (𝑥‘𝑦))
42	33, 39, 41	syl2anc 584	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → ((0_g‘(𝑅‘𝑦))(+_g‘(𝑅‘𝑦))(𝑥‘𝑦)) = (𝑥‘𝑦))
43	31, 42	eqtrd 2772	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → (( 0 ‘𝑦)(+_g‘(𝑅‘𝑦))(𝑥‘𝑦)) = (𝑥‘𝑦))
44	43	mpteq2dva 5248	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑦 ∈ 𝐼 ↦ (( 0 ‘𝑦)(+_g‘(𝑅‘𝑦))(𝑥‘𝑦))) = (𝑦 ∈ 𝐼 ↦ (𝑥‘𝑦)))
45	20	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑆 ∈ 𝑉)
46	21	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐼 ∈ 𝑊)
47	22	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑅 Fn 𝐼)
48	25	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 0 ∈ 𝐵)
49		simpr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
50		prdsplusgcl.p	. . . . . 6 ⊢ + = (+_g‘𝑌)
51	18, 19, 45, 46, 47, 48, 49, 50	prdsplusgval 17421	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = (𝑦 ∈ 𝐼 ↦ (( 0 ‘𝑦)(+_g‘(𝑅‘𝑦))(𝑥‘𝑦))))
52	18, 19, 45, 46, 47, 49	prdsbasfn 17419	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 Fn 𝐼)
53		dffn5 6950	. . . . . 6 ⊢ (𝑥 Fn 𝐼 ↔ 𝑥 = (𝑦 ∈ 𝐼 ↦ (𝑥‘𝑦)))
54	52, 53	sylib 217	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 = (𝑦 ∈ 𝐼 ↦ (𝑥‘𝑦)))
55	44, 51, 54	3eqtr4d 2782	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( 0 + 𝑥) = 𝑥)
56	30	oveq2d 7427	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → ((𝑥‘𝑦)(+_g‘(𝑅‘𝑦))( 0 ‘𝑦)) = ((𝑥‘𝑦)(+_g‘(𝑅‘𝑦))(0_g‘(𝑅‘𝑦))))
57	13, 40, 14	mndrid 18648	. . . . . . . 8 ⊢ (((𝑅‘𝑦) ∈ Mnd ∧ (𝑥‘𝑦) ∈ (Base‘(𝑅‘𝑦))) → ((𝑥‘𝑦)(+_g‘(𝑅‘𝑦))(0_g‘(𝑅‘𝑦))) = (𝑥‘𝑦))
58	33, 39, 57	syl2anc 584	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → ((𝑥‘𝑦)(+_g‘(𝑅‘𝑦))(0_g‘(𝑅‘𝑦))) = (𝑥‘𝑦))
59	56, 58	eqtrd 2772	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐼) → ((𝑥‘𝑦)(+_g‘(𝑅‘𝑦))( 0 ‘𝑦)) = (𝑥‘𝑦))
60	59	mpteq2dva 5248	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑦 ∈ 𝐼 ↦ ((𝑥‘𝑦)(+_g‘(𝑅‘𝑦))( 0 ‘𝑦))) = (𝑦 ∈ 𝐼 ↦ (𝑥‘𝑦)))
61	18, 19, 45, 46, 47, 49, 48, 50	prdsplusgval 17421	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 + 0 ) = (𝑦 ∈ 𝐼 ↦ ((𝑥‘𝑦)(+_g‘(𝑅‘𝑦))( 0 ‘𝑦))))
62	60, 61, 54	3eqtr4d 2782	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 + 0 ) = 𝑥)
63	55, 62	jca 512	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))
64	63	ralrimiva 3146	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥))
65	25, 64	jca 512	1 ⊢ (𝜑 → ( 0 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐵 (( 0 + 𝑥) = 𝑥 ∧ (𝑥 + 0 ) = 𝑥)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 Vcvv 3474 ↦ cmpt 5231 ∘ ccom 5680 Fn wfn 6538 ⟶wf 6539 ‘cfv 6543 (class class class)co 7411 Basecbs 17146 +_gcplusg 17199 0_gc0g 17387 X_scprds 17393 Mndcmnd 18627

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-er 8705 df-map 8824 df-ixp 8894 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-nn 12215 df-2 12277 df-3 12278 df-4 12279 df-5 12280 df-6 12281 df-7 12282 df-8 12283 df-9 12284 df-n0 12475 df-z 12561 df-dec 12680 df-uz 12825 df-fz 13487 df-struct 17082 df-slot 17117 df-ndx 17129 df-base 17147 df-plusg 17212 df-mulr 17213 df-sca 17215 df-vsca 17216 df-ip 17217 df-tset 17218 df-ple 17219 df-ds 17221 df-hom 17223 df-cco 17224 df-0g 17389 df-prds 17395 df-mgm 18563 df-sgrp 18612 df-mnd 18628

This theorem is referenced by: prdsmndd 18660 prds0g 18661

W3C validator