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

Theorem dprdres 19937
Description: Restriction of a direct product (dropping factors). (Contributed by Mario Carneiro, 25-Apr-2016.)
Hypotheses
Ref Expression
dprdres.1 (𝜑𝐺dom DProd 𝑆)
dprdres.2 (𝜑 → dom 𝑆 = 𝐼)
dprdres.3 (𝜑𝐴𝐼)
Assertion
Ref Expression
dprdres (𝜑 → (𝐺dom DProd (𝑆𝐴) ∧ (𝐺 DProd (𝑆𝐴)) ⊆ (𝐺 DProd 𝑆)))

Proof of Theorem dprdres
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dprdres.1 . . . 4 (𝜑𝐺dom DProd 𝑆)
2 dprdgrp 19914 . . . 4 (𝐺dom DProd 𝑆𝐺 ∈ Grp)
31, 2syl 17 . . 3 (𝜑𝐺 ∈ Grp)
4 dprdres.2 . . . . 5 (𝜑 → dom 𝑆 = 𝐼)
51, 4dprdf2 19916 . . . 4 (𝜑𝑆:𝐼⟶(SubGrp‘𝐺))
6 dprdres.3 . . . 4 (𝜑𝐴𝐼)
75, 6fssresd 6685 . . 3 (𝜑 → (𝑆𝐴):𝐴⟶(SubGrp‘𝐺))
81ad2antrr 726 . . . . . . . 8 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → 𝐺dom DProd 𝑆)
94ad2antrr 726 . . . . . . . 8 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → dom 𝑆 = 𝐼)
106ad2antrr 726 . . . . . . . . 9 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → 𝐴𝐼)
11 simplr 768 . . . . . . . . 9 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → 𝑥𝐴)
1210, 11sseldd 3930 . . . . . . . 8 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → 𝑥𝐼)
13 eldifi 4076 . . . . . . . . . 10 (𝑦 ∈ (𝐴 ∖ {𝑥}) → 𝑦𝐴)
1413adantl 481 . . . . . . . . 9 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → 𝑦𝐴)
1510, 14sseldd 3930 . . . . . . . 8 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → 𝑦𝐼)
16 eldifsni 4737 . . . . . . . . . 10 (𝑦 ∈ (𝐴 ∖ {𝑥}) → 𝑦𝑥)
1716adantl 481 . . . . . . . . 9 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → 𝑦𝑥)
1817necomd 2983 . . . . . . . 8 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → 𝑥𝑦)
19 eqid 2731 . . . . . . . 8 (Cntz‘𝐺) = (Cntz‘𝐺)
208, 9, 12, 15, 18, 19dprdcntz 19917 . . . . . . 7 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → (𝑆𝑥) ⊆ ((Cntz‘𝐺)‘(𝑆𝑦)))
2111fvresd 6837 . . . . . . 7 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → ((𝑆𝐴)‘𝑥) = (𝑆𝑥))
2214fvresd 6837 . . . . . . . 8 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → ((𝑆𝐴)‘𝑦) = (𝑆𝑦))
2322fveq2d 6821 . . . . . . 7 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → ((Cntz‘𝐺)‘((𝑆𝐴)‘𝑦)) = ((Cntz‘𝐺)‘(𝑆𝑦)))
2420, 21, 233sstr4d 3985 . . . . . 6 (((𝜑𝑥𝐴) ∧ 𝑦 ∈ (𝐴 ∖ {𝑥})) → ((𝑆𝐴)‘𝑥) ⊆ ((Cntz‘𝐺)‘((𝑆𝐴)‘𝑦)))
2524ralrimiva 3124 . . . . 5 ((𝜑𝑥𝐴) → ∀𝑦 ∈ (𝐴 ∖ {𝑥})((𝑆𝐴)‘𝑥) ⊆ ((Cntz‘𝐺)‘((𝑆𝐴)‘𝑦)))
26 fvres 6836 . . . . . . . 8 (𝑥𝐴 → ((𝑆𝐴)‘𝑥) = (𝑆𝑥))
2726adantl 481 . . . . . . 7 ((𝜑𝑥𝐴) → ((𝑆𝐴)‘𝑥) = (𝑆𝑥))
2827ineq1d 4164 . . . . . 6 ((𝜑𝑥𝐴) → (((𝑆𝐴)‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))) = ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))))
29 eqid 2731 . . . . . . . . . . . . 13 (Base‘𝐺) = (Base‘𝐺)
3029subgacs 19068 . . . . . . . . . . . 12 (𝐺 ∈ Grp → (SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)))
31 acsmre 17553 . . . . . . . . . . . 12 ((SubGrp‘𝐺) ∈ (ACS‘(Base‘𝐺)) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
323, 30, 313syl 18 . . . . . . . . . . 11 (𝜑 → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
3332adantr 480 . . . . . . . . . 10 ((𝜑𝑥𝐴) → (SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)))
34 eqid 2731 . . . . . . . . . 10 (mrCls‘(SubGrp‘𝐺)) = (mrCls‘(SubGrp‘𝐺))
35 resss 5945 . . . . . . . . . . . . 13 (𝑆𝐴) ⊆ 𝑆
36 imass1 6045 . . . . . . . . . . . . 13 ((𝑆𝐴) ⊆ 𝑆 → ((𝑆𝐴) “ (𝐴 ∖ {𝑥})) ⊆ (𝑆 “ (𝐴 ∖ {𝑥})))
3735, 36ax-mp 5 . . . . . . . . . . . 12 ((𝑆𝐴) “ (𝐴 ∖ {𝑥})) ⊆ (𝑆 “ (𝐴 ∖ {𝑥}))
386adantr 480 . . . . . . . . . . . . 13 ((𝜑𝑥𝐴) → 𝐴𝐼)
39 ssdif 4089 . . . . . . . . . . . . 13 (𝐴𝐼 → (𝐴 ∖ {𝑥}) ⊆ (𝐼 ∖ {𝑥}))
40 imass2 6046 . . . . . . . . . . . . 13 ((𝐴 ∖ {𝑥}) ⊆ (𝐼 ∖ {𝑥}) → (𝑆 “ (𝐴 ∖ {𝑥})) ⊆ (𝑆 “ (𝐼 ∖ {𝑥})))
4138, 39, 403syl 18 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → (𝑆 “ (𝐴 ∖ {𝑥})) ⊆ (𝑆 “ (𝐼 ∖ {𝑥})))
4237, 41sstrid 3941 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → ((𝑆𝐴) “ (𝐴 ∖ {𝑥})) ⊆ (𝑆 “ (𝐼 ∖ {𝑥})))
4342unissd 4864 . . . . . . . . . 10 ((𝜑𝑥𝐴) → ((𝑆𝐴) “ (𝐴 ∖ {𝑥})) ⊆ (𝑆 “ (𝐼 ∖ {𝑥})))
44 imassrn 6015 . . . . . . . . . . . 12 (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ ran 𝑆
455frnd 6654 . . . . . . . . . . . . . 14 (𝜑 → ran 𝑆 ⊆ (SubGrp‘𝐺))
4629subgss 19035 . . . . . . . . . . . . . . . 16 (𝑥 ∈ (SubGrp‘𝐺) → 𝑥 ⊆ (Base‘𝐺))
47 velpw 4550 . . . . . . . . . . . . . . . 16 (𝑥 ∈ 𝒫 (Base‘𝐺) ↔ 𝑥 ⊆ (Base‘𝐺))
4846, 47sylibr 234 . . . . . . . . . . . . . . 15 (𝑥 ∈ (SubGrp‘𝐺) → 𝑥 ∈ 𝒫 (Base‘𝐺))
4948ssriv 3933 . . . . . . . . . . . . . 14 (SubGrp‘𝐺) ⊆ 𝒫 (Base‘𝐺)
5045, 49sstrdi 3942 . . . . . . . . . . . . 13 (𝜑 → ran 𝑆 ⊆ 𝒫 (Base‘𝐺))
5150adantr 480 . . . . . . . . . . . 12 ((𝜑𝑥𝐴) → ran 𝑆 ⊆ 𝒫 (Base‘𝐺))
5244, 51sstrid 3941 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ 𝒫 (Base‘𝐺))
53 sspwuni 5043 . . . . . . . . . . 11 ((𝑆 “ (𝐼 ∖ {𝑥})) ⊆ 𝒫 (Base‘𝐺) ↔ (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺))
5452, 53sylib 218 . . . . . . . . . 10 ((𝜑𝑥𝐴) → (𝑆 “ (𝐼 ∖ {𝑥})) ⊆ (Base‘𝐺))
5533, 34, 43, 54mrcssd 17525 . . . . . . . . 9 ((𝜑𝑥𝐴) → ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥}))) ⊆ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (𝐼 ∖ {𝑥}))))
56 sslin 4188 . . . . . . . . 9 (((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥}))) ⊆ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (𝐼 ∖ {𝑥}))) → ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))) ⊆ ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (𝐼 ∖ {𝑥})))))
5755, 56syl 17 . . . . . . . 8 ((𝜑𝑥𝐴) → ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))) ⊆ ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (𝐼 ∖ {𝑥})))))
581adantr 480 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝐺dom DProd 𝑆)
594adantr 480 . . . . . . . . 9 ((𝜑𝑥𝐴) → dom 𝑆 = 𝐼)
606sselda 3929 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝑥𝐼)
61 eqid 2731 . . . . . . . . 9 (0g𝐺) = (0g𝐺)
6258, 59, 60, 61, 34dprddisj 19918 . . . . . . . 8 ((𝜑𝑥𝐴) → ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ (𝑆 “ (𝐼 ∖ {𝑥})))) = {(0g𝐺)})
6357, 62sseqtrd 3966 . . . . . . 7 ((𝜑𝑥𝐴) → ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))) ⊆ {(0g𝐺)})
645ffvelcdmda 7012 . . . . . . . . . . 11 ((𝜑𝑥𝐼) → (𝑆𝑥) ∈ (SubGrp‘𝐺))
6560, 64syldan 591 . . . . . . . . . 10 ((𝜑𝑥𝐴) → (𝑆𝑥) ∈ (SubGrp‘𝐺))
6661subg0cl 19042 . . . . . . . . . 10 ((𝑆𝑥) ∈ (SubGrp‘𝐺) → (0g𝐺) ∈ (𝑆𝑥))
6765, 66syl 17 . . . . . . . . 9 ((𝜑𝑥𝐴) → (0g𝐺) ∈ (𝑆𝑥))
6843, 54sstrd 3940 . . . . . . . . . . 11 ((𝜑𝑥𝐴) → ((𝑆𝐴) “ (𝐴 ∖ {𝑥})) ⊆ (Base‘𝐺))
6934mrccl 17512 . . . . . . . . . . 11 (((SubGrp‘𝐺) ∈ (Moore‘(Base‘𝐺)) ∧ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})) ⊆ (Base‘𝐺)) → ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
7033, 68, 69syl2anc 584 . . . . . . . . . 10 ((𝜑𝑥𝐴) → ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥}))) ∈ (SubGrp‘𝐺))
7161subg0cl 19042 . . . . . . . . . 10 (((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥}))) ∈ (SubGrp‘𝐺) → (0g𝐺) ∈ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥}))))
7270, 71syl 17 . . . . . . . . 9 ((𝜑𝑥𝐴) → (0g𝐺) ∈ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥}))))
7367, 72elind 4145 . . . . . . . 8 ((𝜑𝑥𝐴) → (0g𝐺) ∈ ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))))
7473snssd 4756 . . . . . . 7 ((𝜑𝑥𝐴) → {(0g𝐺)} ⊆ ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))))
7563, 74eqssd 3947 . . . . . 6 ((𝜑𝑥𝐴) → ((𝑆𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))) = {(0g𝐺)})
7628, 75eqtrd 2766 . . . . 5 ((𝜑𝑥𝐴) → (((𝑆𝐴)‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))) = {(0g𝐺)})
7725, 76jca 511 . . . 4 ((𝜑𝑥𝐴) → (∀𝑦 ∈ (𝐴 ∖ {𝑥})((𝑆𝐴)‘𝑥) ⊆ ((Cntz‘𝐺)‘((𝑆𝐴)‘𝑦)) ∧ (((𝑆𝐴)‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))) = {(0g𝐺)}))
7877ralrimiva 3124 . . 3 (𝜑 → ∀𝑥𝐴 (∀𝑦 ∈ (𝐴 ∖ {𝑥})((𝑆𝐴)‘𝑥) ⊆ ((Cntz‘𝐺)‘((𝑆𝐴)‘𝑦)) ∧ (((𝑆𝐴)‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))) = {(0g𝐺)}))
791, 4dprddomcld 19910 . . . . 5 (𝜑𝐼 ∈ V)
8079, 6ssexd 5257 . . . 4 (𝜑𝐴 ∈ V)
817fdmd 6656 . . . 4 (𝜑 → dom (𝑆𝐴) = 𝐴)
8219, 61, 34dmdprd 19907 . . . 4 ((𝐴 ∈ V ∧ dom (𝑆𝐴) = 𝐴) → (𝐺dom DProd (𝑆𝐴) ↔ (𝐺 ∈ Grp ∧ (𝑆𝐴):𝐴⟶(SubGrp‘𝐺) ∧ ∀𝑥𝐴 (∀𝑦 ∈ (𝐴 ∖ {𝑥})((𝑆𝐴)‘𝑥) ⊆ ((Cntz‘𝐺)‘((𝑆𝐴)‘𝑦)) ∧ (((𝑆𝐴)‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))) = {(0g𝐺)}))))
8380, 81, 82syl2anc 584 . . 3 (𝜑 → (𝐺dom DProd (𝑆𝐴) ↔ (𝐺 ∈ Grp ∧ (𝑆𝐴):𝐴⟶(SubGrp‘𝐺) ∧ ∀𝑥𝐴 (∀𝑦 ∈ (𝐴 ∖ {𝑥})((𝑆𝐴)‘𝑥) ⊆ ((Cntz‘𝐺)‘((𝑆𝐴)‘𝑦)) ∧ (((𝑆𝐴)‘𝑥) ∩ ((mrCls‘(SubGrp‘𝐺))‘ ((𝑆𝐴) “ (𝐴 ∖ {𝑥})))) = {(0g𝐺)}))))
843, 7, 78, 83mpbir3and 1343 . 2 (𝜑𝐺dom DProd (𝑆𝐴))
85 rnss 5874 . . . . . 6 ((𝑆𝐴) ⊆ 𝑆 → ran (𝑆𝐴) ⊆ ran 𝑆)
86 uniss 4862 . . . . . 6 (ran (𝑆𝐴) ⊆ ran 𝑆 ran (𝑆𝐴) ⊆ ran 𝑆)
8735, 85, 86mp2b 10 . . . . 5 ran (𝑆𝐴) ⊆ ran 𝑆
8887a1i 11 . . . 4 (𝜑 ran (𝑆𝐴) ⊆ ran 𝑆)
89 sspwuni 5043 . . . . 5 (ran 𝑆 ⊆ 𝒫 (Base‘𝐺) ↔ ran 𝑆 ⊆ (Base‘𝐺))
9050, 89sylib 218 . . . 4 (𝜑 ran 𝑆 ⊆ (Base‘𝐺))
9132, 34, 88, 90mrcssd 17525 . . 3 (𝜑 → ((mrCls‘(SubGrp‘𝐺))‘ ran (𝑆𝐴)) ⊆ ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
9234dprdspan 19936 . . . 4 (𝐺dom DProd (𝑆𝐴) → (𝐺 DProd (𝑆𝐴)) = ((mrCls‘(SubGrp‘𝐺))‘ ran (𝑆𝐴)))
9384, 92syl 17 . . 3 (𝜑 → (𝐺 DProd (𝑆𝐴)) = ((mrCls‘(SubGrp‘𝐺))‘ ran (𝑆𝐴)))
9434dprdspan 19936 . . . 4 (𝐺dom DProd 𝑆 → (𝐺 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
951, 94syl 17 . . 3 (𝜑 → (𝐺 DProd 𝑆) = ((mrCls‘(SubGrp‘𝐺))‘ ran 𝑆))
9691, 93, 953sstr4d 3985 . 2 (𝜑 → (𝐺 DProd (𝑆𝐴)) ⊆ (𝐺 DProd 𝑆))
9784, 96jca 511 1 (𝜑 → (𝐺dom DProd (𝑆𝐴) ∧ (𝐺 DProd (𝑆𝐴)) ⊆ (𝐺 DProd 𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2111  wne 2928  wral 3047  Vcvv 3436  cdif 3894  cin 3896  wss 3897  𝒫 cpw 4545  {csn 4571   cuni 4854   class class class wbr 5086  dom cdm 5611  ran crn 5612  cres 5613  cima 5614  wf 6472  cfv 6476  (class class class)co 7341  Basecbs 17115  0gc0g 17338  Moorecmre 17479  mrClscmrc 17480  ACScacs 17482  Grpcgrp 18841  SubGrpcsubg 19028  Cntzccntz 19222   DProd cdprd 19902
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5212  ax-sep 5229  ax-nul 5239  ax-pow 5298  ax-pr 5365  ax-un 7663  ax-cnex 11057  ax-resscn 11058  ax-1cn 11059  ax-icn 11060  ax-addcl 11061  ax-addrcl 11062  ax-mulcl 11063  ax-mulrcl 11064  ax-mulcom 11065  ax-addass 11066  ax-mulass 11067  ax-distr 11068  ax-i2m1 11069  ax-1ne0 11070  ax-1rid 11071  ax-rnegex 11072  ax-rrecex 11073  ax-cnre 11074  ax-pre-lttri 11075  ax-pre-lttrn 11076  ax-pre-ltadd 11077  ax-pre-mulgt0 11078
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4279  df-if 4471  df-pw 4547  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-int 4893  df-iun 4938  df-iin 4939  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5506  df-eprel 5511  df-po 5519  df-so 5520  df-fr 5564  df-se 5565  df-we 5566  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-pred 6243  df-ord 6304  df-on 6305  df-lim 6306  df-suc 6307  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-f1 6481  df-fo 6482  df-f1o 6483  df-fv 6484  df-isom 6485  df-riota 7298  df-ov 7344  df-oprab 7345  df-mpo 7346  df-of 7605  df-om 7792  df-1st 7916  df-2nd 7917  df-supp 8086  df-tpos 8151  df-frecs 8206  df-wrecs 8237  df-recs 8286  df-rdg 8324  df-1o 8380  df-2o 8381  df-er 8617  df-map 8747  df-ixp 8817  df-en 8865  df-dom 8866  df-sdom 8867  df-fin 8868  df-fsupp 9241  df-oi 9391  df-card 9827  df-pnf 11143  df-mnf 11144  df-xr 11145  df-ltxr 11146  df-le 11147  df-sub 11341  df-neg 11342  df-nn 12121  df-2 12183  df-n0 12377  df-z 12464  df-uz 12728  df-fz 13403  df-fzo 13550  df-seq 13904  df-hash 14233  df-sets 17070  df-slot 17088  df-ndx 17100  df-base 17116  df-ress 17137  df-plusg 17169  df-0g 17340  df-gsum 17341  df-mre 17483  df-mrc 17484  df-acs 17486  df-mgm 18543  df-sgrp 18622  df-mnd 18638  df-mhm 18686  df-submnd 18687  df-grp 18844  df-minusg 18845  df-sbg 18846  df-mulg 18976  df-subg 19031  df-ghm 19120  df-gim 19166  df-cntz 19224  df-oppg 19253  df-cmn 19689  df-dprd 19904
This theorem is referenced by:  dprdf1  19942  dprdcntz2  19947  dprddisj2  19948  dprd2dlem1  19950  dprd2da  19951  dmdprdsplit  19956  dprdsplit  19957  dpjf  19966  dpjidcl  19967  dpjlid  19970  dpjghm  19972  ablfac1eulem  19981  ablfac1eu  19982
  Copyright terms: Public domain W3C validator