nsgmgc - Mathbox for Thierry Arnoux

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

Theorem nsgmgc 32523

Description: There is a monotone Galois connection between the lattice of subgroups of a group 𝐺 containing a normal subgroup 𝑁 and the lattice of subgroups of the quotient group 𝐺 / 𝑁. This is sometimes called the lattice theorem. (Contributed by Thierry Arnoux, 27-Jul-2024.)

**Hypotheses**
Ref	Expression
nsgmgc.b	⊢ 𝐵 = (Base‘𝐺)
nsgmgc.s	⊢ 𝑆 = {ℎ ∈ (SubGrp‘𝐺) ∣ 𝑁 ⊆ ℎ}
nsgmgc.t	⊢ 𝑇 = (SubGrp‘𝑄)
nsgmgc.j	⊢ 𝐽 = (𝑉MGalConn𝑊)
nsgmgc.v	⊢ 𝑉 = (toInc‘𝑆)
nsgmgc.w	⊢ 𝑊 = (toInc‘𝑇)
nsgmgc.q	⊢ 𝑄 = (𝐺 /_s (𝐺 ~_QG 𝑁))
nsgmgc.p	⊢ ⊕ = (LSSum‘𝐺)
nsgmgc.e	⊢ 𝐸 = (ℎ ∈ 𝑆 ↦ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
nsgmgc.f	⊢ 𝐹 = (𝑓 ∈ 𝑇 ↦ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
nsgmgc.n	⊢ (𝜑 → 𝑁 ∈ (NrmSGrp‘𝐺))

**Assertion**
Ref	Expression
nsgmgc	⊢ (𝜑 → 𝐸𝐽𝐹)

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

Proof of Theorem nsgmgc Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1918	. . . . 5 ⊢ Ⅎℎ𝜑
2		vex 3479	. . . . . . . 8 ⊢ ℎ ∈ V
3	2	mptex 7225	. . . . . . 7 ⊢ (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ∈ V
4	3	rnex 7903	. . . . . 6 ⊢ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ∈ V
5	4	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ∈ V)
6		nsgmgc.e	. . . . 5 ⊢ 𝐸 = (ℎ ∈ 𝑆 ↦ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
7	1, 5, 6	fnmptd 6692	. . . 4 ⊢ (𝜑 → 𝐸 Fn 𝑆)
8		nsgmgc.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐺)
9		nsgmgc.q	. . . . . . . 8 ⊢ 𝑄 = (𝐺 /_s (𝐺 ~_QG 𝑁))
10		nsgmgc.p	. . . . . . . 8 ⊢ ⊕ = (LSSum‘𝐺)
11		mpteq1 5242	. . . . . . . . . . 11 ⊢ (ℎ = 𝑘 → (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) = (𝑥 ∈ 𝑘 ↦ ({𝑥} ⊕ 𝑁)))
12	11	rneqd 5938	. . . . . . . . . 10 ⊢ (ℎ = 𝑘 → ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) = ran (𝑥 ∈ 𝑘 ↦ ({𝑥} ⊕ 𝑁)))
13	12	cbvmptv 5262	. . . . . . . . 9 ⊢ (ℎ ∈ 𝑆 ↦ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))) = (𝑘 ∈ 𝑆 ↦ ran (𝑥 ∈ 𝑘 ↦ ({𝑥} ⊕ 𝑁)))
14	6, 13	eqtri 2761	. . . . . . . 8 ⊢ 𝐸 = (𝑘 ∈ 𝑆 ↦ ran (𝑥 ∈ 𝑘 ↦ ({𝑥} ⊕ 𝑁)))
15		eqid 2733	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝑁)) = (𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝑁))
16		nsgmgc.n	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ (NrmSGrp‘𝐺))
17	16	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → 𝑁 ∈ (NrmSGrp‘𝐺))
18		simpr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → ℎ ∈ 𝑆)
19		nsgmgc.s	. . . . . . . . . 10 ⊢ 𝑆 = {ℎ ∈ (SubGrp‘𝐺) ∣ 𝑁 ⊆ ℎ}
20	19	ssrab3 4081	. . . . . . . . 9 ⊢ 𝑆 ⊆ (SubGrp‘𝐺)
21	20	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → 𝑆 ⊆ (SubGrp‘𝐺))
22	8, 9, 10, 14, 15, 17, 18, 21	qusima 32519	. . . . . . 7 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → (𝐸‘ℎ) = ((𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝑁)) “ ℎ))
23	8, 9, 15	qusghm 19129	. . . . . . . . 9 ⊢ (𝑁 ∈ (NrmSGrp‘𝐺) → (𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝑁)) ∈ (𝐺 GrpHom 𝑄))
24	17, 23	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → (𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝑁)) ∈ (𝐺 GrpHom 𝑄))
25	20	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ⊆ (SubGrp‘𝐺))
26	25	sselda 3983	. . . . . . . 8 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → ℎ ∈ (SubGrp‘𝐺))
27		ghmima 19113	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝑁)) ∈ (𝐺 GrpHom 𝑄) ∧ ℎ ∈ (SubGrp‘𝐺)) → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝑁)) “ ℎ) ∈ (SubGrp‘𝑄))
28	24, 26, 27	syl2anc 585	. . . . . . 7 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → ((𝑥 ∈ 𝐵 ↦ [𝑥](𝐺 ~_QG 𝑁)) “ ℎ) ∈ (SubGrp‘𝑄))
29	22, 28	eqeltrd 2834	. . . . . 6 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → (𝐸‘ℎ) ∈ (SubGrp‘𝑄))
30		nsgmgc.t	. . . . . 6 ⊢ 𝑇 = (SubGrp‘𝑄)
31	29, 30	eleqtrrdi 2845	. . . . 5 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → (𝐸‘ℎ) ∈ 𝑇)
32	31	ralrimiva 3147	. . . 4 ⊢ (𝜑 → ∀ℎ ∈ 𝑆 (𝐸‘ℎ) ∈ 𝑇)
33		ffnfv 7118	. . . 4 ⊢ (𝐸:𝑆⟶𝑇 ↔ (𝐸 Fn 𝑆 ∧ ∀ℎ ∈ 𝑆 (𝐸‘ℎ) ∈ 𝑇))
34	7, 32, 33	sylanbrc 584	. . 3 ⊢ (𝜑 → 𝐸:𝑆⟶𝑇)
35		sseq2 4009	. . . . . 6 ⊢ (ℎ = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} → (𝑁 ⊆ ℎ ↔ 𝑁 ⊆ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓}))
36	16	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → 𝑁 ∈ (NrmSGrp‘𝐺))
37		simpr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → 𝑓 ∈ 𝑇)
38	37, 30	eleqtrdi 2844	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → 𝑓 ∈ (SubGrp‘𝑄))
39	8, 9, 10, 36, 38	nsgmgclem 32522	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ∈ (SubGrp‘𝐺))
40		nsgsubg 19038	. . . . . . . . . 10 ⊢ (𝑁 ∈ (NrmSGrp‘𝐺) → 𝑁 ∈ (SubGrp‘𝐺))
41	16, 40	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ (SubGrp‘𝐺))
42	8	subgss 19007	. . . . . . . . 9 ⊢ (𝑁 ∈ (SubGrp‘𝐺) → 𝑁 ⊆ 𝐵)
43	41, 42	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ⊆ 𝐵)
44	43	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → 𝑁 ⊆ 𝐵)
45	41	ad2antrr 725	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → 𝑁 ∈ (SubGrp‘𝐺))
46		simpr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → 𝑎 ∈ 𝑁)
47	10	grplsmid 32514	. . . . . . . . 9 ⊢ ((𝑁 ∈ (SubGrp‘𝐺) ∧ 𝑎 ∈ 𝑁) → ({𝑎} ⊕ 𝑁) = 𝑁)
48	45, 46, 47	syl2anc 585	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → ({𝑎} ⊕ 𝑁) = 𝑁)
49	16	ad2antrr 725	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → 𝑁 ∈ (NrmSGrp‘𝐺))
50	38	adantr 482	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → 𝑓 ∈ (SubGrp‘𝑄))
51	9	nsgqus0 32521	. . . . . . . . 9 ⊢ ((𝑁 ∈ (NrmSGrp‘𝐺) ∧ 𝑓 ∈ (SubGrp‘𝑄)) → 𝑁 ∈ 𝑓)
52	49, 50, 51	syl2anc 585	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → 𝑁 ∈ 𝑓)
53	48, 52	eqeltrd 2834	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝑇) ∧ 𝑎 ∈ 𝑁) → ({𝑎} ⊕ 𝑁) ∈ 𝑓)
54	44, 53	ssrabdv 4072	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → 𝑁 ⊆ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
55	35, 39, 54	elrabd 3686	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ∈ {ℎ ∈ (SubGrp‘𝐺) ∣ 𝑁 ⊆ ℎ})
56	55, 19	eleqtrrdi 2845	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ∈ 𝑆)
57		nsgmgc.f	. . . 4 ⊢ 𝐹 = (𝑓 ∈ 𝑇 ↦ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
58	56, 57	fmptd 7114	. . 3 ⊢ (𝜑 → 𝐹:𝑇⟶𝑆)
59	34, 58	jca 513	. 2 ⊢ (𝜑 → (𝐸:𝑆⟶𝑇 ∧ 𝐹:𝑇⟶𝑆))
60	8	subgss 19007	. . . . . . . . . 10 ⊢ (ℎ ∈ (SubGrp‘𝐺) → ℎ ⊆ 𝐵)
61	26, 60	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → ℎ ⊆ 𝐵)
62	61	ad2antrr 725	. . . . . . . 8 ⊢ ((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) → ℎ ⊆ 𝐵)
63	6	fvmpt2 7010	. . . . . . . . . . . 12 ⊢ ((ℎ ∈ 𝑆 ∧ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ∈ V) → (𝐸‘ℎ) = ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
64	18, 4, 63	sylancl 587	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ℎ ∈ 𝑆) → (𝐸‘ℎ) = ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
65	64	ad5ant12 755	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) ∧ 𝑎 ∈ ℎ) → (𝐸‘ℎ) = ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
66		simplr 768	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) ∧ 𝑎 ∈ ℎ) → (𝐸‘ℎ) ⊆ 𝑓)
67	65, 66	eqsstrrd 4022	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) ∧ 𝑎 ∈ ℎ) → ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ⊆ 𝑓)
68		eqid 2733	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) = (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁))
69		simpr 486	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) ∧ 𝑎 ∈ ℎ) → 𝑎 ∈ ℎ)
70		sneq 4639	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑎 → {𝑥} = {𝑎})
71	70	oveq1d 7424	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑎 → ({𝑥} ⊕ 𝑁) = ({𝑎} ⊕ 𝑁))
72	71	eqeq2d 2744	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → (({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁) ↔ ({𝑎} ⊕ 𝑁) = ({𝑎} ⊕ 𝑁)))
73	72	adantl 483	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) ∧ 𝑎 ∈ ℎ) ∧ 𝑥 = 𝑎) → (({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁) ↔ ({𝑎} ⊕ 𝑁) = ({𝑎} ⊕ 𝑁)))
74		eqidd 2734	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) ∧ 𝑎 ∈ ℎ) → ({𝑎} ⊕ 𝑁) = ({𝑎} ⊕ 𝑁))
75	69, 73, 74	rspcedvd 3615	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) ∧ 𝑎 ∈ ℎ) → ∃𝑥 ∈ ℎ ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁))
76		ovexd 7444	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) ∧ 𝑎 ∈ ℎ) → ({𝑎} ⊕ 𝑁) ∈ V)
77	68, 75, 76	elrnmptd 5961	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) ∧ 𝑎 ∈ ℎ) → ({𝑎} ⊕ 𝑁) ∈ ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
78	67, 77	sseldd 3984	. . . . . . . 8 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) ∧ 𝑎 ∈ ℎ) → ({𝑎} ⊕ 𝑁) ∈ 𝑓)
79	62, 78	ssrabdv 4072	. . . . . . 7 ⊢ ((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) → ℎ ⊆ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
80		simpr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) → 𝑓 ∈ 𝑇)
81	8	fvexi 6906	. . . . . . . . . 10 ⊢ 𝐵 ∈ V
82	81	rabex 5333	. . . . . . . . 9 ⊢ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ∈ V
83	57	fvmpt2 7010	. . . . . . . . 9 ⊢ ((𝑓 ∈ 𝑇 ∧ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ∈ V) → (𝐹‘𝑓) = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
84	80, 82, 83	sylancl 587	. . . . . . . 8 ⊢ (((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) → (𝐹‘𝑓) = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
85	84	adantr 482	. . . . . . 7 ⊢ ((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) → (𝐹‘𝑓) = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
86	79, 85	sseqtrrd 4024	. . . . . 6 ⊢ ((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ (𝐸‘ℎ) ⊆ 𝑓) → ℎ ⊆ (𝐹‘𝑓))
87	64	ad2antrr 725	. . . . . . 7 ⊢ ((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ ℎ ⊆ (𝐹‘𝑓)) → (𝐸‘ℎ) = ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)))
88		simpr 486	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ ℎ ⊆ (𝐹‘𝑓)) → ℎ ⊆ (𝐹‘𝑓))
89	88	sselda 3983	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ ℎ ⊆ (𝐹‘𝑓)) ∧ 𝑥 ∈ ℎ) → 𝑥 ∈ (𝐹‘𝑓))
90	84	ad2antrr 725	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ ℎ ⊆ (𝐹‘𝑓)) ∧ 𝑥 ∈ ℎ) → (𝐹‘𝑓) = {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
91	89, 90	eleqtrd 2836	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ ℎ ⊆ (𝐹‘𝑓)) ∧ 𝑥 ∈ ℎ) → 𝑥 ∈ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓})
92		sneq 4639	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝑥 → {𝑎} = {𝑥})
93	92	oveq1d 7424	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝑥 → ({𝑎} ⊕ 𝑁) = ({𝑥} ⊕ 𝑁))
94	93	eleq1d 2819	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑥 → (({𝑎} ⊕ 𝑁) ∈ 𝑓 ↔ ({𝑥} ⊕ 𝑁) ∈ 𝑓))
95	94	elrab 3684	. . . . . . . . . . 11 ⊢ (𝑥 ∈ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} ↔ (𝑥 ∈ 𝐵 ∧ ({𝑥} ⊕ 𝑁) ∈ 𝑓))
96	95	simprbi 498	. . . . . . . . . 10 ⊢ (𝑥 ∈ {𝑎 ∈ 𝐵 ∣ ({𝑎} ⊕ 𝑁) ∈ 𝑓} → ({𝑥} ⊕ 𝑁) ∈ 𝑓)
97	91, 96	syl 17	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ ℎ ⊆ (𝐹‘𝑓)) ∧ 𝑥 ∈ ℎ) → ({𝑥} ⊕ 𝑁) ∈ 𝑓)
98	97	ralrimiva 3147	. . . . . . . 8 ⊢ ((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ ℎ ⊆ (𝐹‘𝑓)) → ∀𝑥 ∈ ℎ ({𝑥} ⊕ 𝑁) ∈ 𝑓)
99	68	rnmptss 7122	. . . . . . . 8 ⊢ (∀𝑥 ∈ ℎ ({𝑥} ⊕ 𝑁) ∈ 𝑓 → ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ⊆ 𝑓)
100	98, 99	syl 17	. . . . . . 7 ⊢ ((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ ℎ ⊆ (𝐹‘𝑓)) → ran (𝑥 ∈ ℎ ↦ ({𝑥} ⊕ 𝑁)) ⊆ 𝑓)
101	87, 100	eqsstrd 4021	. . . . . 6 ⊢ ((((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) ∧ ℎ ⊆ (𝐹‘𝑓)) → (𝐸‘ℎ) ⊆ 𝑓)
102	86, 101	impbida 800	. . . . 5 ⊢ (((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) → ((𝐸‘ℎ) ⊆ 𝑓 ↔ ℎ ⊆ (𝐹‘𝑓)))
103	30	fvexi 6906	. . . . . 6 ⊢ 𝑇 ∈ V
104		nsgmgc.w	. . . . . . 7 ⊢ 𝑊 = (toInc‘𝑇)
105		eqid 2733	. . . . . . 7 ⊢ (le‘𝑊) = (le‘𝑊)
106	104, 105	ipole 18487	. . . . . 6 ⊢ ((𝑇 ∈ V ∧ (𝐸‘ℎ) ∈ 𝑇 ∧ 𝑓 ∈ 𝑇) → ((𝐸‘ℎ)(le‘𝑊)𝑓 ↔ (𝐸‘ℎ) ⊆ 𝑓))
107	103, 31, 80, 106	mp3an2ani 1469	. . . . 5 ⊢ (((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) → ((𝐸‘ℎ)(le‘𝑊)𝑓 ↔ (𝐸‘ℎ) ⊆ 𝑓))
108		fvex 6905	. . . . . . 7 ⊢ (SubGrp‘𝐺) ∈ V
109	19, 108	rabex2 5335	. . . . . 6 ⊢ 𝑆 ∈ V
110	58	ffvelcdmda 7087	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑇) → (𝐹‘𝑓) ∈ 𝑆)
111	110	adantlr 714	. . . . . 6 ⊢ (((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) → (𝐹‘𝑓) ∈ 𝑆)
112		nsgmgc.v	. . . . . . 7 ⊢ 𝑉 = (toInc‘𝑆)
113		eqid 2733	. . . . . . 7 ⊢ (le‘𝑉) = (le‘𝑉)
114	112, 113	ipole 18487	. . . . . 6 ⊢ ((𝑆 ∈ V ∧ ℎ ∈ 𝑆 ∧ (𝐹‘𝑓) ∈ 𝑆) → (ℎ(le‘𝑉)(𝐹‘𝑓) ↔ ℎ ⊆ (𝐹‘𝑓)))
115	109, 18, 111, 114	mp3an2ani 1469	. . . . 5 ⊢ (((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) → (ℎ(le‘𝑉)(𝐹‘𝑓) ↔ ℎ ⊆ (𝐹‘𝑓)))
116	102, 107, 115	3bitr4d 311	. . . 4 ⊢ (((𝜑 ∧ ℎ ∈ 𝑆) ∧ 𝑓 ∈ 𝑇) → ((𝐸‘ℎ)(le‘𝑊)𝑓 ↔ ℎ(le‘𝑉)(𝐹‘𝑓)))
117	116	anasss 468	. . 3 ⊢ ((𝜑 ∧ (ℎ ∈ 𝑆 ∧ 𝑓 ∈ 𝑇)) → ((𝐸‘ℎ)(le‘𝑊)𝑓 ↔ ℎ(le‘𝑉)(𝐹‘𝑓)))
118	117	ralrimivva 3201	. 2 ⊢ (𝜑 → ∀ℎ ∈ 𝑆 ∀𝑓 ∈ 𝑇 ((𝐸‘ℎ)(le‘𝑊)𝑓 ↔ ℎ(le‘𝑉)(𝐹‘𝑓)))
119	112	ipobas 18484	. . . 4 ⊢ (𝑆 ∈ V → 𝑆 = (Base‘𝑉))
120	109, 119	ax-mp 5	. . 3 ⊢ 𝑆 = (Base‘𝑉)
121	104	ipobas 18484	. . . 4 ⊢ (𝑇 ∈ V → 𝑇 = (Base‘𝑊))
122	103, 121	ax-mp 5	. . 3 ⊢ 𝑇 = (Base‘𝑊)
123		nsgmgc.j	. . 3 ⊢ 𝐽 = (𝑉MGalConn𝑊)
124	112	ipopos 18489	. . . 4 ⊢ 𝑉 ∈ Poset
125		posprs 18269	. . . 4 ⊢ (𝑉 ∈ Poset → 𝑉 ∈ Proset )
126	124, 125	mp1i 13	. . 3 ⊢ (𝜑 → 𝑉 ∈ Proset )
127	104	ipopos 18489	. . . 4 ⊢ 𝑊 ∈ Poset
128		posprs 18269	. . . 4 ⊢ (𝑊 ∈ Poset → 𝑊 ∈ Proset )
129	127, 128	mp1i 13	. . 3 ⊢ (𝜑 → 𝑊 ∈ Proset )
130	120, 122, 113, 105, 123, 126, 129	mgcval 32157	. 2 ⊢ (𝜑 → (𝐸𝐽𝐹 ↔ ((𝐸:𝑆⟶𝑇 ∧ 𝐹:𝑇⟶𝑆) ∧ ∀ℎ ∈ 𝑆 ∀𝑓 ∈ 𝑇 ((𝐸‘ℎ)(le‘𝑊)𝑓 ↔ ℎ(le‘𝑉)(𝐹‘𝑓)))))
131	59, 118, 130	mpbir2and 712	1 ⊢ (𝜑 → 𝐸𝐽𝐹)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 {crab 3433 Vcvv 3475 ⊆ wss 3949 {csn 4629 class class class wbr 5149 ↦ cmpt 5232 ran crn 5678 “ cima 5680 Fn wfn 6539 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 [cec 8701 Basecbs 17144 lecple 17204 /_s cqus 17451 Proset cproset 18246 Posetcpo 18260 toInccipo 18480 SubGrpcsubg 19000 NrmSGrpcnsg 19001 ~_QG cqg 19002 GrpHom cghm 19089 LSSumclsm 19502 MGalConncmgc 32149

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-tpos 8211 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-ec 8705 df-qs 8709 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9437 df-inf 9438 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-fz 13485 df-struct 17080 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-mulr 17211 df-sca 17213 df-vsca 17214 df-ip 17215 df-tset 17216 df-ple 17217 df-ocomp 17218 df-ds 17219 df-0g 17387 df-imas 17454 df-qus 17455 df-proset 18248 df-poset 18266 df-ipo 18481 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-submnd 18672 df-grp 18822 df-minusg 18823 df-subg 19003 df-nsg 19004 df-eqg 19005 df-ghm 19090 df-oppg 19210 df-lsm 19504 df-mgc 32151

This theorem is referenced by: nsgqusf1o 32527

W3C validator