Theorem gaorber 19213

Description: The orbit equivalence relation is an equivalence relation on the target set of the group action. (Contributed by NM, 11-Aug-2009.) (Revised by Mario Carneiro, 13-Jan-2015.)

Hypotheses

Ref	Expression
gaorb.1	⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)}
gaorber.2	⊢ 𝑋 = (Base‘𝐺)

Assertion

Ref	Expression
gaorber	⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ∼ Er 𝑌)

Distinct variable groups:   𝑥,𝑔,𝑦, ⊕   𝑔,𝑋,𝑥,𝑦   𝑥,𝑌,𝑦

Allowed substitution hints:   ∼ (𝑥,𝑦,𝑔)   𝐺(𝑥,𝑦,𝑔)   𝑌(𝑔)

Proof of Theorem gaorber

Dummy variables ℎ 𝑓 𝑘 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gaorb.1	. . . 4 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)}
2	1	relopabiv 5820	. . 3 ⊢ Rel ∼
3	2	a1i 11	. 2 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → Rel ∼ )
4		simpr 485	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) → 𝑢 ∼ 𝑣)
5	1	gaorb 19212	. . . . 5 ⊢ (𝑢 ∼ 𝑣 ↔ (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑣))
6	4, 5	sylib 217	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) → (𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑣))
7	6	simp2d 1143	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) → 𝑣 ∈ 𝑌)
8	6	simp1d 1142	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) → 𝑢 ∈ 𝑌)
9	6	simp3d 1144	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) → ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑣)
10		simpll 765	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) ∧ ℎ ∈ 𝑋) → ⊕ ∈ (𝐺 GrpAct 𝑌))
11		simpr 485	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) ∧ ℎ ∈ 𝑋) → ℎ ∈ 𝑋)
12	8	adantr 481	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) ∧ ℎ ∈ 𝑋) → 𝑢 ∈ 𝑌)
13	7	adantr 481	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) ∧ ℎ ∈ 𝑋) → 𝑣 ∈ 𝑌)
14		gaorber.2	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
15		eqid 2732	. . . . . . . 8 ⊢ (invg‘𝐺) = (invg‘𝐺)
16	14, 15	gacan 19210	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (ℎ ∈ 𝑋 ∧ 𝑢 ∈ 𝑌 ∧ 𝑣 ∈ 𝑌)) → ((ℎ ⊕ 𝑢) = 𝑣 ↔ (((invg‘𝐺)‘ℎ) ⊕ 𝑣) = 𝑢))
17	10, 11, 12, 13, 16	syl13anc 1372	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) ∧ ℎ ∈ 𝑋) → ((ℎ ⊕ 𝑢) = 𝑣 ↔ (((invg‘𝐺)‘ℎ) ⊕ 𝑣) = 𝑢))
18		gagrp 19197	. . . . . . . . 9 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → 𝐺 ∈ Grp)
19	18	adantr 481	. . . . . . . 8 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) → 𝐺 ∈ Grp)
20	14, 15	grpinvcl 18908	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ ℎ ∈ 𝑋) → ((invg‘𝐺)‘ℎ) ∈ 𝑋)
21	19, 20	sylan 580	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) ∧ ℎ ∈ 𝑋) → ((invg‘𝐺)‘ℎ) ∈ 𝑋)
22		oveq1 7418	. . . . . . . . . 10 ⊢ (𝑘 = ((invg‘𝐺)‘ℎ) → (𝑘 ⊕ 𝑣) = (((invg‘𝐺)‘ℎ) ⊕ 𝑣))
23	22	eqeq1d 2734	. . . . . . . . 9 ⊢ (𝑘 = ((invg‘𝐺)‘ℎ) → ((𝑘 ⊕ 𝑣) = 𝑢 ↔ (((invg‘𝐺)‘ℎ) ⊕ 𝑣) = 𝑢))
24	23	rspcev 3612	. . . . . . . 8 ⊢ ((((invg‘𝐺)‘ℎ) ∈ 𝑋 ∧ (((invg‘𝐺)‘ℎ) ⊕ 𝑣) = 𝑢) → ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑢)
25	24	ex 413	. . . . . . 7 ⊢ (((invg‘𝐺)‘ℎ) ∈ 𝑋 → ((((invg‘𝐺)‘ℎ) ⊕ 𝑣) = 𝑢 → ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑢))
26	21, 25	syl 17	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) ∧ ℎ ∈ 𝑋) → ((((invg‘𝐺)‘ℎ) ⊕ 𝑣) = 𝑢 → ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑢))
27	17, 26	sylbid 239	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) ∧ ℎ ∈ 𝑋) → ((ℎ ⊕ 𝑢) = 𝑣 → ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑢))
28	27	rexlimdva 3155	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) → (∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑣 → ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑢))
29	9, 28	mpd 15	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) → ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑢)
30	1	gaorb 19212	. . 3 ⊢ (𝑣 ∼ 𝑢 ↔ (𝑣 ∈ 𝑌 ∧ 𝑢 ∈ 𝑌 ∧ ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑢))
31	7, 8, 29, 30	syl3anbrc 1343	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∼ 𝑣) → 𝑣 ∼ 𝑢)
32	8	adantrr 715	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) → 𝑢 ∈ 𝑌)
33		simprr 771	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) → 𝑣 ∼ 𝑤)
34	1	gaorb 19212	. . . . 5 ⊢ (𝑣 ∼ 𝑤 ↔ (𝑣 ∈ 𝑌 ∧ 𝑤 ∈ 𝑌 ∧ ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑤))
35	33, 34	sylib 217	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) → (𝑣 ∈ 𝑌 ∧ 𝑤 ∈ 𝑌 ∧ ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑤))
36	35	simp2d 1143	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) → 𝑤 ∈ 𝑌)
37	9	adantrr 715	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) → ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑣)
38	35	simp3d 1144	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) → ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑤)
39		reeanv 3226	. . . . 5 ⊢ (∃ℎ ∈ 𝑋 ∃𝑘 ∈ 𝑋 ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤) ↔ (∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑣 ∧ ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑤))
40	18	ad2antrr 724	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → 𝐺 ∈ Grp)
41		simprlr 778	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → 𝑘 ∈ 𝑋)
42		simprll 777	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → ℎ ∈ 𝑋)
43		eqid 2732	. . . . . . . . . 10 ⊢ (+g‘𝐺) = (+g‘𝐺)
44	14, 43	grpcl 18863	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋) → (𝑘(+g‘𝐺)ℎ) ∈ 𝑋)
45	40, 41, 42, 44	syl3anc 1371	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → (𝑘(+g‘𝐺)ℎ) ∈ 𝑋)
46		simpll 765	. . . . . . . . . 10 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → ⊕ ∈ (𝐺 GrpAct 𝑌))
47	32	adantr 481	. . . . . . . . . 10 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → 𝑢 ∈ 𝑌)
48	14, 43	gaass 19202	. . . . . . . . . 10 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋 ∧ 𝑢 ∈ 𝑌)) → ((𝑘(+g‘𝐺)ℎ) ⊕ 𝑢) = (𝑘 ⊕ (ℎ ⊕ 𝑢)))
49	46, 41, 42, 47, 48	syl13anc 1372	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → ((𝑘(+g‘𝐺)ℎ) ⊕ 𝑢) = (𝑘 ⊕ (ℎ ⊕ 𝑢)))
50		simprrl 779	. . . . . . . . . 10 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → (ℎ ⊕ 𝑢) = 𝑣)
51	50	oveq2d 7427	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → (𝑘 ⊕ (ℎ ⊕ 𝑢)) = (𝑘 ⊕ 𝑣))
52		simprrr 780	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → (𝑘 ⊕ 𝑣) = 𝑤)
53	49, 51, 52	3eqtrd 2776	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → ((𝑘(+g‘𝐺)ℎ) ⊕ 𝑢) = 𝑤)
54		oveq1 7418	. . . . . . . . . 10 ⊢ (𝑓 = (𝑘(+g‘𝐺)ℎ) → (𝑓 ⊕ 𝑢) = ((𝑘(+g‘𝐺)ℎ) ⊕ 𝑢))
55	54	eqeq1d 2734	. . . . . . . . 9 ⊢ (𝑓 = (𝑘(+g‘𝐺)ℎ) → ((𝑓 ⊕ 𝑢) = 𝑤 ↔ ((𝑘(+g‘𝐺)ℎ) ⊕ 𝑢) = 𝑤))
56	55	rspcev 3612	. . . . . . . 8 ⊢ (((𝑘(+g‘𝐺)ℎ) ∈ 𝑋 ∧ ((𝑘(+g‘𝐺)ℎ) ⊕ 𝑢) = 𝑤) → ∃𝑓 ∈ 𝑋 (𝑓 ⊕ 𝑢) = 𝑤)
57	45, 53, 56	syl2anc 584	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ ((ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋) ∧ ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤))) → ∃𝑓 ∈ 𝑋 (𝑓 ⊕ 𝑢) = 𝑤)
58	57	expr 457	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) ∧ (ℎ ∈ 𝑋 ∧ 𝑘 ∈ 𝑋)) → (((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤) → ∃𝑓 ∈ 𝑋 (𝑓 ⊕ 𝑢) = 𝑤))
59	58	rexlimdvva 3211	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) → (∃ℎ ∈ 𝑋 ∃𝑘 ∈ 𝑋 ((ℎ ⊕ 𝑢) = 𝑣 ∧ (𝑘 ⊕ 𝑣) = 𝑤) → ∃𝑓 ∈ 𝑋 (𝑓 ⊕ 𝑢) = 𝑤))
60	39, 59	biimtrrid 242	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) → ((∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑣 ∧ ∃𝑘 ∈ 𝑋 (𝑘 ⊕ 𝑣) = 𝑤) → ∃𝑓 ∈ 𝑋 (𝑓 ⊕ 𝑢) = 𝑤))
61	37, 38, 60	mp2and 697	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) → ∃𝑓 ∈ 𝑋 (𝑓 ⊕ 𝑢) = 𝑤)
62	1	gaorb 19212	. . 3 ⊢ (𝑢 ∼ 𝑤 ↔ (𝑢 ∈ 𝑌 ∧ 𝑤 ∈ 𝑌 ∧ ∃𝑓 ∈ 𝑋 (𝑓 ⊕ 𝑢) = 𝑤))
63	32, 36, 61, 62	syl3anbrc 1343	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ (𝑢 ∼ 𝑣 ∧ 𝑣 ∼ 𝑤)) → 𝑢 ∼ 𝑤)
64	18	adantr 481	. . . . . . . 8 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∈ 𝑌) → 𝐺 ∈ Grp)
65		eqid 2732	. . . . . . . . 9 ⊢ (0g‘𝐺) = (0g‘𝐺)
66	14, 65	grpidcl 18886	. . . . . . . 8 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝑋)
67	64, 66	syl 17	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∈ 𝑌) → (0g‘𝐺) ∈ 𝑋)
68	65	gagrpid 19199	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∈ 𝑌) → ((0g‘𝐺) ⊕ 𝑢) = 𝑢)
69		oveq1 7418	. . . . . . . . 9 ⊢ (ℎ = (0g‘𝐺) → (ℎ ⊕ 𝑢) = ((0g‘𝐺) ⊕ 𝑢))
70	69	eqeq1d 2734	. . . . . . . 8 ⊢ (ℎ = (0g‘𝐺) → ((ℎ ⊕ 𝑢) = 𝑢 ↔ ((0g‘𝐺) ⊕ 𝑢) = 𝑢))
71	70	rspcev 3612	. . . . . . 7 ⊢ (((0g‘𝐺) ∈ 𝑋 ∧ ((0g‘𝐺) ⊕ 𝑢) = 𝑢) → ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢)
72	67, 68, 71	syl2anc 584	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝑢 ∈ 𝑌) → ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢)
73	72	ex 413	. . . . 5 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → (𝑢 ∈ 𝑌 → ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢))
74	73	pm4.71rd 563	. . . 4 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → (𝑢 ∈ 𝑌 ↔ (∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢 ∧ 𝑢 ∈ 𝑌)))
75		df-3an 1089	. . . . 5 ⊢ ((𝑢 ∈ 𝑌 ∧ 𝑢 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢) ↔ ((𝑢 ∈ 𝑌 ∧ 𝑢 ∈ 𝑌) ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢))
76		anidm 565	. . . . . 6 ⊢ ((𝑢 ∈ 𝑌 ∧ 𝑢 ∈ 𝑌) ↔ 𝑢 ∈ 𝑌)
77	76	anbi2ci 625	. . . . 5 ⊢ (((𝑢 ∈ 𝑌 ∧ 𝑢 ∈ 𝑌) ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢) ↔ (∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢 ∧ 𝑢 ∈ 𝑌))
78	75, 77	bitri 274	. . . 4 ⊢ ((𝑢 ∈ 𝑌 ∧ 𝑢 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢) ↔ (∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢 ∧ 𝑢 ∈ 𝑌))
79	74, 78	bitr4di 288	. . 3 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → (𝑢 ∈ 𝑌 ↔ (𝑢 ∈ 𝑌 ∧ 𝑢 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢)))
80	1	gaorb 19212	. . 3 ⊢ (𝑢 ∼ 𝑢 ↔ (𝑢 ∈ 𝑌 ∧ 𝑢 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝑢) = 𝑢))
81	79, 80	bitr4di 288	. 2 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → (𝑢 ∈ 𝑌 ↔ 𝑢 ∼ 𝑢))
82	3, 31, 63, 81	iserd 8731	1 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ∼ Er 𝑌)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∃wrex 3070   ⊆ wss 3948  {cpr 4630   class class class wbr 5148  {copab 5210  Rel wrel 5681  ‘cfv 6543  (class class class)co 7411   Er wer 8702  Basecbs 17148  +_gcplusg 17201  0_gc0g 17389  Grpcgrp 18855  inv_gcminusg 18856   GrpAct cga 19194

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-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7727

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  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-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-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  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-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-riota 7367  df-ov 7414  df-oprab 7415  df-mpo 7416  df-er 8705  df-map 8824  df-0g 17391  df-mgm 18565  df-sgrp 18644  df-mnd 18660  df-grp 18858  df-minusg 18859  df-ga 19195

This theorem is referenced by:  sylow1lem3  19509  sylow1lem5  19511  sylow2alem1  19526  sylow2alem2  19527  sylow2a  19528  sylow3lem3  19538