ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  subgintm GIF version

Theorem subgintm 14054
Description: The intersection of an inhabited collection of subgroups is a subgroup. (Contributed by Mario Carneiro, 7-Dec-2014.)
Assertion
Ref Expression
subgintm ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ∩ 𝑆 ∈ (SubGrp‘𝐺))
Distinct variable groups:   𝑤,𝐺   𝑤,𝑆

Proof of Theorem subgintm
Dummy variables 𝑥 𝑔 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 intssunim 3992 . . . 4 (∃𝑤 𝑤 ∈ 𝑆 → ∩ 𝑆 ⊆ ∪ 𝑆)
21adantl 277 . . 3 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ∩ 𝑆 ⊆ ∪ 𝑆)
3 ssel2 3243 . . . . . . 7 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑆) → 𝑔 ∈ (SubGrp‘𝐺))
43adantlr 481 . . . . . 6 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑔 ∈ 𝑆) → 𝑔 ∈ (SubGrp‘𝐺))
5 eqid 2238 . . . . . . 7 (Base‘𝐺) = (Base‘𝐺)
65subgss 14030 . . . . . 6 (𝑔 ∈ (SubGrp‘𝐺) → 𝑔 ⊆ (Base‘𝐺))
74, 6syl 14 . . . . 5 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑔 ∈ 𝑆) → 𝑔 ⊆ (Base‘𝐺))
87ralrimiva 2623 . . . 4 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ∀𝑔 ∈ 𝑆 𝑔 ⊆ (Base‘𝐺))
9 unissb 3965 . . . 4 (∪ 𝑆 ⊆ (Base‘𝐺) ↔ ∀𝑔 ∈ 𝑆 𝑔 ⊆ (Base‘𝐺))
108, 9sylibr 134 . . 3 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ∪ 𝑆 ⊆ (Base‘𝐺))
112, 10sstrd 3258 . 2 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ∩ 𝑆 ⊆ (Base‘𝐺))
12 eqid 2238 . . . . . . 7 (0g‘𝐺) = (0g‘𝐺)
1312subg0cl 14038 . . . . . 6 (𝑔 ∈ (SubGrp‘𝐺) → (0g‘𝐺) ∈ 𝑔)
144, 13syl 14 . . . . 5 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑔 ∈ 𝑆) → (0g‘𝐺) ∈ 𝑔)
1514ralrimiva 2623 . . . 4 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ∀𝑔 ∈ 𝑆 (0g‘𝐺) ∈ 𝑔)
16 ssel 3242 . . . . . . . 8 (𝑆 ⊆ (SubGrp‘𝐺) → (𝑤 ∈ 𝑆 → 𝑤 ∈ (SubGrp‘𝐺)))
1716eximdv 1933 . . . . . . 7 (𝑆 ⊆ (SubGrp‘𝐺) → (∃𝑤 𝑤 ∈ 𝑆 → ∃𝑤 𝑤 ∈ (SubGrp‘𝐺)))
1817imp 124 . . . . . 6 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ∃𝑤 𝑤 ∈ (SubGrp‘𝐺))
19 subgrcl 14035 . . . . . . 7 (𝑤 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
2019exlimiv 1651 . . . . . 6 (∃𝑤 𝑤 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
2118, 20syl 14 . . . . 5 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → 𝐺 ∈ Grp)
225, 12grpidcl 13887 . . . . 5 (𝐺 ∈ Grp → (0g‘𝐺) ∈ (Base‘𝐺))
23 elintg 3978 . . . . 5 ((0g‘𝐺) ∈ (Base‘𝐺) → ((0g‘𝐺) ∈ ∩ 𝑆 ↔ ∀𝑔 ∈ 𝑆 (0g‘𝐺) ∈ 𝑔))
2421, 22, 233syl 17 . . . 4 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ((0g‘𝐺) ∈ ∩ 𝑆 ↔ ∀𝑔 ∈ 𝑆 (0g‘𝐺) ∈ 𝑔))
2515, 24mpbird 167 . . 3 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → (0g‘𝐺) ∈ ∩ 𝑆)
26 elex2 2838 . . 3 ((0g‘𝐺) ∈ ∩ 𝑆 → ∃𝑤 𝑤 ∈ ∩ 𝑆)
2725, 26syl 14 . 2 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ∃𝑤 𝑤 ∈ ∩ 𝑆)
284adantlr 481 . . . . . . . . 9 ((((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑔 ∈ 𝑆) → 𝑔 ∈ (SubGrp‘𝐺))
29 simprl 535 . . . . . . . . . 10 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → 𝑥 ∈ ∩ 𝑆)
30 elinti 3979 . . . . . . . . . . 11 (𝑥 ∈ ∩ 𝑆 → (𝑔 ∈ 𝑆 → 𝑥 ∈ 𝑔))
3130imp 124 . . . . . . . . . 10 ((𝑥 ∈ ∩ 𝑆 ∧ 𝑔 ∈ 𝑆) → 𝑥 ∈ 𝑔)
3229, 31sylan 283 . . . . . . . . 9 ((((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑔 ∈ 𝑆) → 𝑥 ∈ 𝑔)
33 simprr 537 . . . . . . . . . 10 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → 𝑦 ∈ ∩ 𝑆)
34 elinti 3979 . . . . . . . . . . 11 (𝑦 ∈ ∩ 𝑆 → (𝑔 ∈ 𝑆 → 𝑦 ∈ 𝑔))
3534imp 124 . . . . . . . . . 10 ((𝑦 ∈ ∩ 𝑆 ∧ 𝑔 ∈ 𝑆) → 𝑦 ∈ 𝑔)
3633, 35sylan 283 . . . . . . . . 9 ((((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑔 ∈ 𝑆) → 𝑦 ∈ 𝑔)
37 eqid 2238 . . . . . . . . . 10 (+g‘𝐺) = (+g‘𝐺)
3837subgcl 14040 . . . . . . . . 9 ((𝑔 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑔 ∧ 𝑦 ∈ 𝑔) → (𝑥(+g‘𝐺)𝑦) ∈ 𝑔)
3928, 32, 36, 38syl3anc 1278 . . . . . . . 8 ((((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑔 ∈ 𝑆) → (𝑥(+g‘𝐺)𝑦) ∈ 𝑔)
4039ralrimiva 2623 . . . . . . 7 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → ∀𝑔 ∈ 𝑆 (𝑥(+g‘𝐺)𝑦) ∈ 𝑔)
41 vex 2824 . . . . . . . . . . 11 𝑥 ∈ V
4241a1i 9 . . . . . . . . . 10 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → 𝑥 ∈ V)
43 plusgslid 13519 . . . . . . . . . . . 12 (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
4443slotex 13431 . . . . . . . . . . 11 (𝐺 ∈ Grp → (+g‘𝐺) ∈ V)
4518, 20, 443syl 17 . . . . . . . . . 10 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → (+g‘𝐺) ∈ V)
46 vex 2824 . . . . . . . . . . 11 𝑦 ∈ V
4746a1i 9 . . . . . . . . . 10 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → 𝑦 ∈ V)
48 ovexg 6119 . . . . . . . . . 10 ((𝑥 ∈ V ∧ (+g‘𝐺) ∈ V ∧ 𝑦 ∈ V) → (𝑥(+g‘𝐺)𝑦) ∈ V)
4942, 45, 47, 48syl3anc 1278 . . . . . . . . 9 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → (𝑥(+g‘𝐺)𝑦) ∈ V)
50 elintg 3978 . . . . . . . . 9 ((𝑥(+g‘𝐺)𝑦) ∈ V → ((𝑥(+g‘𝐺)𝑦) ∈ ∩ 𝑆 ↔ ∀𝑔 ∈ 𝑆 (𝑥(+g‘𝐺)𝑦) ∈ 𝑔))
5149, 50syl 14 . . . . . . . 8 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ((𝑥(+g‘𝐺)𝑦) ∈ ∩ 𝑆 ↔ ∀𝑔 ∈ 𝑆 (𝑥(+g‘𝐺)𝑦) ∈ 𝑔))
5251adantr 276 . . . . . . 7 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → ((𝑥(+g‘𝐺)𝑦) ∈ ∩ 𝑆 ↔ ∀𝑔 ∈ 𝑆 (𝑥(+g‘𝐺)𝑦) ∈ 𝑔))
5340, 52mpbird 167 . . . . . 6 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → (𝑥(+g‘𝐺)𝑦) ∈ ∩ 𝑆)
5453anassrs 404 . . . . 5 ((((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) ∧ 𝑦 ∈ ∩ 𝑆) → (𝑥(+g‘𝐺)𝑦) ∈ ∩ 𝑆)
5554ralrimiva 2623 . . . 4 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) → ∀𝑦 ∈ ∩ 𝑆(𝑥(+g‘𝐺)𝑦) ∈ ∩ 𝑆)
564adantlr 481 . . . . . . 7 ((((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) ∧ 𝑔 ∈ 𝑆) → 𝑔 ∈ (SubGrp‘𝐺))
5731adantll 480 . . . . . . 7 ((((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) ∧ 𝑔 ∈ 𝑆) → 𝑥 ∈ 𝑔)
58 eqid 2238 . . . . . . . 8 (invg‘𝐺) = (invg‘𝐺)
5958subginvcl 14039 . . . . . . 7 ((𝑔 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑔) → ((invg‘𝐺)‘𝑥) ∈ 𝑔)
6056, 57, 59syl2anc 415 . . . . . 6 ((((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) ∧ 𝑔 ∈ 𝑆) → ((invg‘𝐺)‘𝑥) ∈ 𝑔)
6160ralrimiva 2623 . . . . 5 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) → ∀𝑔 ∈ 𝑆 ((invg‘𝐺)‘𝑥) ∈ 𝑔)
6221adantr 276 . . . . . . 7 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) → 𝐺 ∈ Grp)
6311sselda 3248 . . . . . . 7 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) → 𝑥 ∈ (Base‘𝐺))
645, 58grpinvcl 13906 . . . . . . 7 ((𝐺 ∈ Grp ∧ 𝑥 ∈ (Base‘𝐺)) → ((invg‘𝐺)‘𝑥) ∈ (Base‘𝐺))
6562, 63, 64syl2anc 415 . . . . . 6 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) → ((invg‘𝐺)‘𝑥) ∈ (Base‘𝐺))
66 elintg 3978 . . . . . 6 (((invg‘𝐺)‘𝑥) ∈ (Base‘𝐺) → (((invg‘𝐺)‘𝑥) ∈ ∩ 𝑆 ↔ ∀𝑔 ∈ 𝑆 ((invg‘𝐺)‘𝑥) ∈ 𝑔))
6765, 66syl 14 . . . . 5 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) → (((invg‘𝐺)‘𝑥) ∈ ∩ 𝑆 ↔ ∀𝑔 ∈ 𝑆 ((invg‘𝐺)‘𝑥) ∈ 𝑔))
6861, 67mpbird 167 . . . 4 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) → ((invg‘𝐺)‘𝑥) ∈ ∩ 𝑆)
6955, 68jca 306 . . 3 (((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) ∧ 𝑥 ∈ ∩ 𝑆) → (∀𝑦 ∈ ∩ 𝑆(𝑥(+g‘𝐺)𝑦) ∈ ∩ 𝑆 ∧ ((invg‘𝐺)‘𝑥) ∈ ∩ 𝑆))
7069ralrimiva 2623 . 2 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ∀𝑥 ∈ ∩ 𝑆(∀𝑦 ∈ ∩ 𝑆(𝑥(+g‘𝐺)𝑦) ∈ ∩ 𝑆 ∧ ((invg‘𝐺)‘𝑥) ∈ ∩ 𝑆))
715, 37, 58issubg2m 14045 . . 3 (𝐺 ∈ Grp → (∩ 𝑆 ∈ (SubGrp‘𝐺) ↔ (∩ 𝑆 ⊆ (Base‘𝐺) ∧ ∃𝑤 𝑤 ∈ ∩ 𝑆 ∧ ∀𝑥 ∈ ∩ 𝑆(∀𝑦 ∈ ∩ 𝑆(𝑥(+g‘𝐺)𝑦) ∈ ∩ 𝑆 ∧ ((invg‘𝐺)‘𝑥) ∈ ∩ 𝑆))))
7218, 20, 713syl 17 . 2 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → (∩ 𝑆 ∈ (SubGrp‘𝐺) ↔ (∩ 𝑆 ⊆ (Base‘𝐺) ∧ ∃𝑤 𝑤 ∈ ∩ 𝑆 ∧ ∀𝑥 ∈ ∩ 𝑆(∀𝑦 ∈ ∩ 𝑆(𝑥(+g‘𝐺)𝑦) ∈ ∩ 𝑆 ∧ ((invg‘𝐺)‘𝑥) ∈ ∩ 𝑆))))
7311, 27, 70, 72mpbir3and 1211 1 ((𝑆 ⊆ (SubGrp‘𝐺) ∧ ∃𝑤 𝑤 ∈ 𝑆) → ∩ 𝑆 ∈ (SubGrp‘𝐺))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ⊆ wss 3220  ∪ cuni 3935  ∩ cint 3970  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +gcplusg 13484  0gc0g 13663  Grpcgrp 13858  invgcminusg 13859  SubGrpcsubg 14023
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-ltadd 8296
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-ndx 13407  df-slot 13408  df-base 13410  df-sets 13411  df-iress 13412  df-plusg 13497  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862  df-subg 14026
This theorem is used by:  subrngintm  14604  subrgintm  14635
  Copyright terms: Public domain W3C validator