nsgqusf1olem3 - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > nsgqusf1olem3		Structured version Visualization version GIF version

Theorem nsgqusf1olem3 32193

Description: Lemma for nsgqusf1o 32194. (Contributed by Thierry Arnoux, 4-Aug-2024.)

**Hypotheses**
Ref	Expression
nsgqusf1o.b	⊢ 𝐵 = (Base‘𝐺)
nsgqusf1o.s	⊢ 𝑆 = {ℎ ∈ (SubGrp‘𝐺) ∣ 𝑁 ⊆ ℎ}
nsgqusf1o.t	⊢ 𝑇 = (SubGrp‘𝑄)
nsgqusf1o.1	⊢ ≤ = (le‘(toInc‘𝑆))
nsgqusf1o.2	⊢ ≲ = (le‘(toInc‘𝑇))
nsgqusf1o.q	⊢ 𝑄 = (𝐺 /_s (𝐺 ~_QG 𝑁))
nsgqusf1o.p	⊢ ⊕ = (LSSum‘𝐺)
nsgqusf1o.e	⊢ 𝐸 = (ℎ ∈ 𝑆 ↦ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
nsgqusf1o.f	⊢ 𝐹 = (𝑓 ∈ 𝑇 ↦ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
nsgqusf1o.n	⊢ (𝜑 → 𝑁 ∈ (NrmSGrp‘𝐺))

**Assertion**
Ref	Expression
nsgqusf1olem3	⊢ (𝜑 → ran 𝐹 = 𝑆)

Distinct variable groups: ⊕ ,𝑎,𝑓,ℎ,𝑥 𝐵,𝑎,𝑓,ℎ,𝑥 𝐸,𝑎,𝑓,ℎ,𝑥 𝑓,𝐹,ℎ,𝑥 𝐺,𝑎,𝑓,ℎ,𝑥 𝑁,𝑎,𝑓,ℎ,𝑥 𝑄,𝑎,𝑓,ℎ,𝑥 𝑆,𝑎,𝑓,ℎ,𝑥 𝑇,𝑎,𝑓,ℎ,𝑥 𝜑,𝑎,𝑓,ℎ,𝑥 Allowed substitution hints: 𝐹(𝑎) ≤ (𝑥,𝑓,ℎ,𝑎) ≲ (𝑥,𝑓,ℎ,𝑎)

**Proof of Theorem nsgqusf1olem3**
Step	Hyp	Ref	Expression
1		nsgqusf1o.f	. . . . 5 ⊢ 𝐹 = (𝑓 ∈ 𝑇 ↦ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
2	1	elrnmpt 5911	. . . 4 ⊢ (ℎ ∈ V → (ℎ ∈ ran 𝐹 ↔ ∃𝑓 ∈ 𝑇 ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}))
3	2	elv 3451	. . 3 ⊢ (ℎ ∈ ran 𝐹 ↔ ∃𝑓 ∈ 𝑇 ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
4		nsgqusf1o.s	. . . . 5 ⊢ 𝑆 = {ℎ ∈ (SubGrp‘𝐺) ∣ 𝑁 ⊆ ℎ}
5	4	reqabi 3429	. . . 4 ⊢ (ℎ ∈ 𝑆 ↔ (ℎ ∈ (SubGrp‘𝐺) ∧ 𝑁 ⊆ ℎ))
6		nsgqusf1o.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐺)
7		nsgqusf1o.t	. . . . . . . 8 ⊢ 𝑇 = (SubGrp‘𝑄)
8		nsgqusf1o.1	. . . . . . . 8 ⊢ ≤ = (le‘(toInc‘𝑆))
9		nsgqusf1o.2	. . . . . . . 8 ⊢ ≲ = (le‘(toInc‘𝑇))
10		nsgqusf1o.q	. . . . . . . 8 ⊢ 𝑄 = (𝐺 /_s (𝐺 ~_QG 𝑁))
11		nsgqusf1o.p	. . . . . . . 8 ⊢ ⊕ = (LSSum‘𝐺)
12		nsgqusf1o.e	. . . . . . . 8 ⊢ 𝐸 = (ℎ ∈ 𝑆 ↦ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
13		nsgqusf1o.n	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ (NrmSGrp‘𝐺))
14	6, 4, 7, 8, 9, 10, 11, 12, 1, 13	nsgqusf1olem1 32191	. . . . . . 7 ⊢ (((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) → ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ∈ 𝑇)
15		eleq2 2826	. . . . . . . . . 10 ⊢ (𝑓 = ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) → (({𝑎} ⊕ 𝑁) ∈ 𝑓 ↔ ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))))
16	15	rabbidv 3415	. . . . . . . . 9 ⊢ (𝑓 = ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) → {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))})
17	16	eqeq2d 2747	. . . . . . . 8 ⊢ (𝑓 = ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) → (ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ↔ ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))}))
18	17	adantl 482	. . . . . . 7 ⊢ ((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑓 = ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))) → (ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ↔ ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))}))
19		nfv 1917	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥(((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵)
20		nfmpt1 5213	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥(𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))
21	20	nfrn 5907	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))
22	21	nfel2 2925	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))
23	19, 22	nfan 1902	. . . . . . . . . . 11 ⊢ Ⅎ𝑥((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
24		nsgsubg 18960	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ (NrmSGrp‘𝐺) → 𝑁 ∈ (SubGrp‘𝐺))
25	13, 24	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ∈ (SubGrp‘𝐺))
26		subgrcl 18933	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
27	25, 26	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐺 ∈ Grp)
28	27	ad4antr 730	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) → 𝐺 ∈ Grp)
29	28	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → 𝐺 ∈ Grp)
30	6	subgss 18929	. . . . . . . . . . . . . . . . 17 ⊢ (ℎ ∈ (SubGrp‘𝐺) → ℎ ⊆ 𝐵)
31	30	ad3antlr 729	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) → ℎ ⊆ 𝐵)
32	31	sselda 3944	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) → 𝑥 ∈ 𝐵)
33	32	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → 𝑥 ∈ 𝐵)
34		simplr 767	. . . . . . . . . . . . . . 15 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) → 𝑎 ∈ 𝐵)
35	34	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → 𝑎 ∈ 𝐵)
36		eqid 2736	. . . . . . . . . . . . . . 15 ⊢ (+_g‘𝐺) = (+_g‘𝐺)
37		eqid 2736	. . . . . . . . . . . . . . 15 ⊢ (inv_g‘𝐺) = (inv_g‘𝐺)
38	6, 36, 37	grpasscan1 18810	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵 ∧ 𝑎 ∈ 𝐵) → (𝑥(+_g‘𝐺)(((inv_g‘𝐺)‘𝑥)(+_g‘𝐺)𝑎)) = 𝑎)
39	29, 33, 35, 38	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → (𝑥(+_g‘𝐺)(((inv_g‘𝐺)‘𝑥)(+_g‘𝐺)𝑎)) = 𝑎)
40		simp-5r 784	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → ℎ ∈ (SubGrp‘𝐺))
41		simplr 767	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → 𝑥 ∈ ℎ)
42		simp-4r 782	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → 𝑁 ⊆ ℎ)
43	6	subgss 18929	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑁 ∈ (SubGrp‘𝐺) → 𝑁 ⊆ 𝐵)
44	25, 43	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑁 ⊆ 𝐵)
45	44	ad5antr 732	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → 𝑁 ⊆ 𝐵)
46		eqid 2736	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐺 ~_QG 𝑁) = (𝐺 ~_QG 𝑁)
47	6, 46	eqger 18980	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ (SubGrp‘𝐺) → (𝐺 ~_QG 𝑁) Er 𝐵)
48	25, 47	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → (𝐺 ~_QG 𝑁) Er 𝐵)
49	48	ad4antr 730	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) → (𝐺 ~_QG 𝑁) Er 𝐵)
50	49	adantr 481	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → (𝐺 ~_QG 𝑁) Er 𝐵)
51	49, 34	erth 8697	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) → (𝑎(𝐺 ~_QG 𝑁)𝑥 ↔ [𝑎](𝐺 ~_QG 𝑁) = [𝑥](𝐺 ~_QG 𝑁)))
52	25	ad4antr 730	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) → 𝑁 ∈ (SubGrp‘𝐺))
53	6, 11, 52, 34	quslsm 32186	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) → [𝑎](𝐺 ~_QG 𝑁) = ({𝑎} ⊕ 𝑁))
54	6, 11, 52, 32	quslsm 32186	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) → [𝑥](𝐺 ~_QG 𝑁) = ({𝑥} ⊕ 𝑁))
55	53, 54	eqeq12d 2752	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) → ([𝑎](𝐺 ~_QG 𝑁) = [𝑥](𝐺 ~_QG 𝑁) ↔ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)))
56	51, 55	bitrd 278	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) → (𝑎(𝐺 ~_QG 𝑁)𝑥 ↔ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)))
57	56	biimpar 478	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → 𝑎(𝐺 ~_QG 𝑁)𝑥)
58	50, 57	ersym 8660	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → 𝑥(𝐺 ~_QG 𝑁)𝑎)
59	6, 37, 36, 46	eqgval 18979	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ⊆ 𝐵) → (𝑥(𝐺 ~_QG 𝑁)𝑎 ↔ (𝑥 ∈ 𝐵 ∧ 𝑎 ∈ 𝐵 ∧ (((inv_g‘𝐺)‘𝑥)(+_g‘𝐺)𝑎) ∈ 𝑁)))
60	59	biimpa 477	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ⊆ 𝐵) ∧ 𝑥(𝐺 ~_QG 𝑁)𝑎) → (𝑥 ∈ 𝐵 ∧ 𝑎 ∈ 𝐵 ∧ (((inv_g‘𝐺)‘𝑥)(+_g‘𝐺)𝑎) ∈ 𝑁))
61	60	simp3d 1144	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ⊆ 𝐵) ∧ 𝑥(𝐺 ~_QG 𝑁)𝑎) → (((inv_g‘𝐺)‘𝑥)(+_g‘𝐺)𝑎) ∈ 𝑁)
62	29, 45, 58, 61	syl21anc 836	. . . . . . . . . . . . . . 15 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → (((inv_g‘𝐺)‘𝑥)(+_g‘𝐺)𝑎) ∈ 𝑁)
63	42, 62	sseldd 3945	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → (((inv_g‘𝐺)‘𝑥)(+_g‘𝐺)𝑎) ∈ ℎ)
64	36	subgcl 18938	. . . . . . . . . . . . . 14 ⊢ ((ℎ ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ ℎ ∧ (((inv_g‘𝐺)‘𝑥)(+_g‘𝐺)𝑎) ∈ ℎ) → (𝑥(+_g‘𝐺)(((inv_g‘𝐺)‘𝑥)(+_g‘𝐺)𝑎)) ∈ ℎ)
65	40, 41, 63, 64	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → (𝑥(+_g‘𝐺)(((inv_g‘𝐺)‘𝑥)(+_g‘𝐺)𝑎)) ∈ ℎ)
66	39, 65	eqeltrrd 2839	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → 𝑎 ∈ ℎ)
67	66	adantllr 717	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))) ∧ 𝑥 ∈ ℎ) ∧ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁)) → 𝑎 ∈ ℎ)
68		eqid 2736	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) = (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))
69		ovex 7390	. . . . . . . . . . . . . 14 ⊢ ({𝑥} ⊕ 𝑁) ∈ V
70	68, 69	elrnmpti 5915	. . . . . . . . . . . . 13 ⊢ (({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ↔ ∃𝑥 ∈ ℎ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁))
71	70	biimpi 215	. . . . . . . . . . . 12 ⊢ (({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) → ∃𝑥 ∈ ℎ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁))
72	71	adantl 482	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))) → ∃𝑥 ∈ ℎ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁))
73	23, 67, 72	r19.29af 3251	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))) → 𝑎 ∈ ℎ)
74		simpr 485	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑎 ∈ ℎ) → 𝑎 ∈ ℎ)
75		ovexd 7392	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑎 ∈ ℎ) → ({𝑎} ⊕ 𝑁) ∈ V)
76		sneq 4596	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑎 → {𝑥} = {𝑎})
77	76	oveq1d 7372	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑎 → ({𝑥} ⊕ 𝑁) = ({𝑎} ⊕ 𝑁))
78	77	eqcomd 2742	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁))
79	78	adantl 482	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑎 ∈ ℎ) ∧ 𝑥 = 𝑎) → ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁))
80	68, 74, 75, 79	elrnmptdv 5917	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) ∧ 𝑎 ∈ ℎ) → ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
81	73, 80	impbida 799	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) ∧ 𝑎 ∈ 𝐵) → (({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ↔ 𝑎 ∈ ℎ))
82	81	rabbidva 3414	. . . . . . . 8 ⊢ (((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) → {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))} = {𝑎 ∈ 𝐵 ∣ 𝑎 ∈ ℎ})
83	30	adantl 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) → ℎ ⊆ 𝐵)
84		dfss7 4200	. . . . . . . . . 10 ⊢ (ℎ ⊆ 𝐵 ↔ {𝑎 ∈ 𝐵 ∣ 𝑎 ∈ ℎ} = ℎ)
85	83, 84	sylib 217	. . . . . . . . 9 ⊢ ((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) → {𝑎 ∈ 𝐵 ∣ 𝑎 ∈ ℎ} = ℎ)
86	85	adantr 481	. . . . . . . 8 ⊢ (((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) → {𝑎 ∈ 𝐵 ∣ 𝑎 ∈ ℎ} = ℎ)
87	82, 86	eqtr2d 2777	. . . . . . 7 ⊢ (((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) → ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))})
88	14, 18, 87	rspcedvd 3583	. . . . . 6 ⊢ (((𝜑 ∧ ℎ ∈ (SubGrp‘𝐺)) ∧ 𝑁 ⊆ ℎ) → ∃𝑓 ∈ 𝑇 ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
89	88	anasss 467	. . . . 5 ⊢ ((𝜑 ∧ (ℎ ∈ (SubGrp‘𝐺) ∧ 𝑁 ⊆ ℎ)) → ∃𝑓 ∈ 𝑇 ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
90	13	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → 𝑁 ∈ (NrmSGrp‘𝐺))
91	7	eleq2i 2829	. . . . . . . . . . . 12 ⊢ (𝑓 ∈ 𝑇 ↔ 𝑓 ∈ (SubGrp‘𝑄))
92	91	biimpi 215	. . . . . . . . . . 11 ⊢ (𝑓 ∈ 𝑇 → 𝑓 ∈ (SubGrp‘𝑄))
93	92	adantl 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → 𝑓 ∈ (SubGrp‘𝑄))
94	6, 10, 11, 90, 93	nsgmgclem 32189	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ∈ (SubGrp‘𝐺))
95	94	adantr 481	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}) → {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ∈ (SubGrp‘𝐺))
96		eleq1 2825	. . . . . . . . 9 ⊢ (ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} → (ℎ ∈ (SubGrp‘𝐺) ↔ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ∈ (SubGrp‘𝐺)))
97	96	adantl 482	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}) → (ℎ ∈ (SubGrp‘𝐺) ↔ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ∈ (SubGrp‘𝐺)))
98	95, 97	mpbird 256	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}) → ℎ ∈ (SubGrp‘𝐺))
99	44	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → 𝑁 ⊆ 𝐵)
100	25	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → 𝑁 ∈ (SubGrp‘𝐺))
101		simpr 485	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → 𝑎 ∈ 𝑁)
102	11	grplsmid 32185	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ (SubGrp‘𝐺) ∧ 𝑎 ∈ 𝑁) → ({𝑎} ⊕ 𝑁) = 𝑁)
103	100, 101, 102	syl2anc 584	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → ({𝑎} ⊕ 𝑁) = 𝑁)
104	10	nsgqus0 32188	. . . . . . . . . . . . 13 ⊢ ((𝑁 ∈ (NrmSGrp‘𝐺) ∧ 𝑓 ∈ (SubGrp‘𝑄)) → 𝑁 ∈ 𝑓)
105	90, 93, 104	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → 𝑁 ∈ 𝑓)
106	105	adantr 481	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → 𝑁 ∈ 𝑓)
107	103, 106	eqeltrd 2838	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → ({𝑎} ⊕ 𝑁) ∈ 𝑓)
108	99, 107	ssrabdv 4031	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → 𝑁 ⊆ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
109	108	adantr 481	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}) → 𝑁 ⊆ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
110		simpr 485	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}) → ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
111	109, 110	sseqtrrd 3985	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}) → 𝑁 ⊆ ℎ)
112	98, 111	jca 512	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}) → (ℎ ∈ (SubGrp‘𝐺) ∧ 𝑁 ⊆ ℎ))
113	112	r19.29an 3155	. . . . 5 ⊢ ((𝜑 ∧ ∃𝑓 ∈ 𝑇 ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}) → (ℎ ∈ (SubGrp‘𝐺) ∧ 𝑁 ⊆ ℎ))
114	89, 113	impbida 799	. . . 4 ⊢ (𝜑 → ((ℎ ∈ (SubGrp‘𝐺) ∧ 𝑁 ⊆ ℎ) ↔ ∃𝑓 ∈ 𝑇 ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}))
115	5, 114	bitrid 282	. . 3 ⊢ (𝜑 → (ℎ ∈ 𝑆 ↔ ∃𝑓 ∈ 𝑇 ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}))
116	3, 115	bitr4id 289	. 2 ⊢ (𝜑 → (ℎ ∈ ran 𝐹 ↔ ℎ ∈ 𝑆))
117	116	eqrdv 2734	1 ⊢ (𝜑 → ran 𝐹 = 𝑆)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∃wrex 3073 {crab 3407 Vcvv 3445 ⊆ wss 3910 {csn 4586 class class class wbr 5105 ↦ cmpt 5188 ran crn 5634 ‘cfv 6496 (class class class)co 7357 Er wer 8645 [cec 8646 Basecbs 17083 +_gcplusg 17133 lecple 17140 /_s cqus 17387 toInccipo 18416 Grpcgrp 18748 inv_gcminusg 18749 SubGrpcsubg 18922 NrmSGrpcnsg 18923 ~_QG cqg 18924 LSSumclsm 19416

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 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128

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 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-tp 4591 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-om 7803 df-1st 7921 df-2nd 7922 df-tpos 8157 df-frecs 8212 df-wrecs 8243 df-recs 8317 df-rdg 8356 df-1o 8412 df-er 8648 df-ec 8650 df-qs 8654 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9378 df-inf 9379 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-nn 12154 df-2 12216 df-3 12217 df-4 12218 df-5 12219 df-6 12220 df-7 12221 df-8 12222 df-9 12223 df-n0 12414 df-z 12500 df-dec 12619 df-uz 12764 df-fz 13425 df-struct 17019 df-sets 17036 df-slot 17054 df-ndx 17066 df-base 17084 df-ress 17113 df-plusg 17146 df-mulr 17147 df-sca 17149 df-vsca 17150 df-ip 17151 df-tset 17152 df-ple 17153 df-ds 17155 df-0g 17323 df-imas 17390 df-qus 17391 df-mgm 18497 df-sgrp 18546 df-mnd 18557 df-submnd 18602 df-grp 18751 df-minusg 18752 df-subg 18925 df-nsg 18926 df-eqg 18927 df-oppg 19124 df-lsm 19418

This theorem is referenced by: nsgqusf1o 32194

W3C validator