Theorem orbsta 19336

Description: The Orbit-Stabilizer theorem. The mapping 𝐹 is a bijection from the cosets of the stabilizer subgroup of 𝐴 to the orbit of 𝐴. (Contributed by Mario Carneiro, 15-Jan-2015.)

Hypotheses

Ref	Expression
gasta.1	⊢ 𝑋 = (Base‘𝐺)
gasta.2	⊢ 𝐻 = {𝑢 ∈ 𝑋 ∣ (𝑢 ⊕ 𝐴) = 𝐴}
orbsta.r	⊢ ∼ = (𝐺 ~QG 𝐻)
orbsta.f	⊢ 𝐹 = ran (𝑘 ∈ 𝑋 ↦ ⟨[𝑘] ∼ , (𝑘 ⊕ 𝐴)⟩)
orbsta.o	⊢ 𝑂 = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)}

Assertion

Ref	Expression
orbsta	⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐹:(𝑋 / ∼ )–1-1-onto→[𝐴]𝑂)

Distinct variable groups:   𝑔,𝑘,𝑥,𝑦, ∼   𝑢,𝑔, ⊕ ,𝑘,𝑥,𝑦   𝑥,𝐻,𝑦   𝐴,𝑔,𝑘,𝑢,𝑥,𝑦   𝑔,𝐺,𝑘,𝑢,𝑥,𝑦   𝑔,𝑋,𝑘,𝑢,𝑥,𝑦   𝑘,𝑂   𝑔,𝑌,𝑘,𝑥,𝑦

Allowed substitution hints:   ∼ (𝑢)   𝐹(𝑥,𝑦,𝑢,𝑔,𝑘)   𝐻(𝑢,𝑔,𝑘)   𝑂(𝑥,𝑦,𝑢,𝑔)   𝑌(𝑢)

Proof of Theorem orbsta

Dummy variables 𝑎 𝑏 ℎ 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gasta.1	. . . . 5 ⊢ 𝑋 = (Base‘𝐺)
2		gasta.2	. . . . 5 ⊢ 𝐻 = {𝑢 ∈ 𝑋 ∣ (𝑢 ⊕ 𝐴) = 𝐴}
3		orbsta.r	. . . . 5 ⊢ ∼ = (𝐺 ~QG 𝐻)
4		orbsta.f	. . . . 5 ⊢ 𝐹 = ran (𝑘 ∈ 𝑋 ↦ ⟨[𝑘] ∼ , (𝑘 ⊕ 𝐴)⟩)
5	1, 2, 3, 4	orbstafun 19334	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → Fun 𝐹)
6		simpr 488	. . . . . . . 8 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐴 ∈ 𝑌)
7	6	adantr 484	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∈ 𝑋) → 𝐴 ∈ 𝑌)
8	1	gaf 19318	. . . . . . . . . 10 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑌) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
9	8	adantr 484	. . . . . . . . 9 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
10	9	adantr 484	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∈ 𝑋) → ⊕ :(𝑋 × 𝑌)⟶𝑌)
11		simpr 488	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∈ 𝑋) → 𝑘 ∈ 𝑋)
12	10, 11, 7	fovcdmd 7564	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∈ 𝑋) → (𝑘 ⊕ 𝐴) ∈ 𝑌)
13		eqid 2761	. . . . . . . 8 ⊢ (𝑘 ⊕ 𝐴) = (𝑘 ⊕ 𝐴)
14		oveq1 7399	. . . . . . . . . 10 ⊢ (ℎ = 𝑘 → (ℎ ⊕ 𝐴) = (𝑘 ⊕ 𝐴))
15	14	eqeq1d 2763	. . . . . . . . 9 ⊢ (ℎ = 𝑘 → ((ℎ ⊕ 𝐴) = (𝑘 ⊕ 𝐴) ↔ (𝑘 ⊕ 𝐴) = (𝑘 ⊕ 𝐴)))
16	15	rspcev 3581	. . . . . . . 8 ⊢ ((𝑘 ∈ 𝑋 ∧ (𝑘 ⊕ 𝐴) = (𝑘 ⊕ 𝐴)) → ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = (𝑘 ⊕ 𝐴))
17	11, 13, 16	sylancl 595	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∈ 𝑋) → ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = (𝑘 ⊕ 𝐴))
18		orbsta.o	. . . . . . . 8 ⊢ 𝑂 = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)}
19	18	gaorb 19330	. . . . . . 7 ⊢ (𝐴𝑂(𝑘 ⊕ 𝐴) ↔ (𝐴 ∈ 𝑌 ∧ (𝑘 ⊕ 𝐴) ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = (𝑘 ⊕ 𝐴)))
20	7, 12, 17, 19	syl3anbrc 1356	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∈ 𝑋) → 𝐴𝑂(𝑘 ⊕ 𝐴))
21		ovex 7425	. . . . . . 7 ⊢ (𝑘 ⊕ 𝐴) ∈ V
22		elecg 8718	. . . . . . 7 ⊢ (((𝑘 ⊕ 𝐴) ∈ V ∧ 𝐴 ∈ 𝑌) → ((𝑘 ⊕ 𝐴) ∈ [𝐴]𝑂 ↔ 𝐴𝑂(𝑘 ⊕ 𝐴)))
23	21, 7, 22	sylancr 596	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∈ 𝑋) → ((𝑘 ⊕ 𝐴) ∈ [𝐴]𝑂 ↔ 𝐴𝑂(𝑘 ⊕ 𝐴)))
24	20, 23	mpbird 259	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∈ 𝑋) → (𝑘 ⊕ 𝐴) ∈ [𝐴]𝑂)
25	1, 2	gastacl 19332	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐻 ∈ (SubGrp‘𝐺))
26	1, 3	eqger 19202	. . . . . 6 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → ∼ Er 𝑋)
27	25, 26	syl 17	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → ∼ Er 𝑋)
28	1	fvexi 6877	. . . . . 6 ⊢ 𝑋 ∈ V
29	28	a1i 11	. . . . 5 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝑋 ∈ V)
30	4, 24, 27, 29	qliftf 8782	. . . 4 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (Fun 𝐹 ↔ 𝐹:(𝑋 / ∼ )⟶[𝐴]𝑂))
31	5, 30	mpbid 234	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐹:(𝑋 / ∼ )⟶[𝐴]𝑂)
32		eqid 2761	. . . . 5 ⊢ (𝑋 / ∼ ) = (𝑋 / ∼ )
33		fveqeq2 6872	. . . . . . 7 ⊢ ([𝑧] ∼ = 𝑎 → ((𝐹‘[𝑧] ∼ ) = (𝐹‘𝑏) ↔ (𝐹‘𝑎) = (𝐹‘𝑏)))
34		eqeq1 2765	. . . . . . 7 ⊢ ([𝑧] ∼ = 𝑎 → ([𝑧] ∼ = 𝑏 ↔ 𝑎 = 𝑏))
35	33, 34	imbi12d 346	. . . . . 6 ⊢ ([𝑧] ∼ = 𝑎 → (((𝐹‘[𝑧] ∼ ) = (𝐹‘𝑏) → [𝑧] ∼ = 𝑏) ↔ ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏)))
36	35	ralbidv 3184	. . . . 5 ⊢ ([𝑧] ∼ = 𝑎 → (∀𝑏 ∈ (𝑋 / ∼ )((𝐹‘[𝑧] ∼ ) = (𝐹‘𝑏) → [𝑧] ∼ = 𝑏) ↔ ∀𝑏 ∈ (𝑋 / ∼ )((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏)))
37		fveq2 6863	. . . . . . . . 9 ⊢ ([𝑤] ∼ = 𝑏 → (𝐹‘[𝑤] ∼ ) = (𝐹‘𝑏))
38	37	eqeq2d 2772	. . . . . . . 8 ⊢ ([𝑤] ∼ = 𝑏 → ((𝐹‘[𝑧] ∼ ) = (𝐹‘[𝑤] ∼ ) ↔ (𝐹‘[𝑧] ∼ ) = (𝐹‘𝑏)))
39		eqeq2 2773	. . . . . . . 8 ⊢ ([𝑤] ∼ = 𝑏 → ([𝑧] ∼ = [𝑤] ∼ ↔ [𝑧] ∼ = 𝑏))
40	38, 39	imbi12d 346	. . . . . . 7 ⊢ ([𝑤] ∼ = 𝑏 → (((𝐹‘[𝑧] ∼ ) = (𝐹‘[𝑤] ∼ ) → [𝑧] ∼ = [𝑤] ∼ ) ↔ ((𝐹‘[𝑧] ∼ ) = (𝐹‘𝑏) → [𝑧] ∼ = 𝑏)))
41	1, 2, 3, 4	orbstaval 19335	. . . . . . . . . . . 12 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑧 ∈ 𝑋) → (𝐹‘[𝑧] ∼ ) = (𝑧 ⊕ 𝐴))
42	41	adantrr 727	. . . . . . . . . . 11 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → (𝐹‘[𝑧] ∼ ) = (𝑧 ⊕ 𝐴))
43	1, 2, 3, 4	orbstaval 19335	. . . . . . . . . . . 12 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑤 ∈ 𝑋) → (𝐹‘[𝑤] ∼ ) = (𝑤 ⊕ 𝐴))
44	43	adantrl 726	. . . . . . . . . . 11 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → (𝐹‘[𝑤] ∼ ) = (𝑤 ⊕ 𝐴))
45	42, 44	eqeq12d 2777	. . . . . . . . . 10 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝐹‘[𝑧] ∼ ) = (𝐹‘[𝑤] ∼ ) ↔ (𝑧 ⊕ 𝐴) = (𝑤 ⊕ 𝐴)))
46	1, 2, 3	gastacos 19333	. . . . . . . . . 10 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → (𝑧 ∼ 𝑤 ↔ (𝑧 ⊕ 𝐴) = (𝑤 ⊕ 𝐴)))
47	27	adantr 484	. . . . . . . . . . 11 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ∼ Er 𝑋)
48		simprl 780	. . . . . . . . . . 11 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → 𝑧 ∈ 𝑋)
49	47, 48	erth 8728	. . . . . . . . . 10 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → (𝑧 ∼ 𝑤 ↔ [𝑧] ∼ = [𝑤] ∼ ))
50	45, 46, 49	3bitr2d 309	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝐹‘[𝑧] ∼ ) = (𝐹‘[𝑤] ∼ ) ↔ [𝑧] ∼ = [𝑤] ∼ ))
51	50	biimpd 231	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑧 ∈ 𝑋 ∧ 𝑤 ∈ 𝑋)) → ((𝐹‘[𝑧] ∼ ) = (𝐹‘[𝑤] ∼ ) → [𝑧] ∼ = [𝑤] ∼ ))
52	51	anassrs 471	. . . . . . 7 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑧 ∈ 𝑋) ∧ 𝑤 ∈ 𝑋) → ((𝐹‘[𝑧] ∼ ) = (𝐹‘[𝑤] ∼ ) → [𝑧] ∼ = [𝑤] ∼ ))
53	32, 40, 52	ectocld 8759	. . . . . 6 ⊢ (((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑧 ∈ 𝑋) ∧ 𝑏 ∈ (𝑋 / ∼ )) → ((𝐹‘[𝑧] ∼ ) = (𝐹‘𝑏) → [𝑧] ∼ = 𝑏))
54	53	ralrimiva 3153	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑧 ∈ 𝑋) → ∀𝑏 ∈ (𝑋 / ∼ )((𝐹‘[𝑧] ∼ ) = (𝐹‘𝑏) → [𝑧] ∼ = 𝑏))
55	32, 36, 54	ectocld 8759	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑎 ∈ (𝑋 / ∼ )) → ∀𝑏 ∈ (𝑋 / ∼ )((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏))
56	55	ralrimiva 3153	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → ∀𝑎 ∈ (𝑋 / ∼ )∀𝑏 ∈ (𝑋 / ∼ )((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏))
57		dff13 7234	. . 3 ⊢ (𝐹:(𝑋 / ∼ )–1-1→[𝐴]𝑂 ↔ (𝐹:(𝑋 / ∼ )⟶[𝐴]𝑂 ∧ ∀𝑎 ∈ (𝑋 / ∼ )∀𝑏 ∈ (𝑋 / ∼ )((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏)))
58	31, 56, 57	sylanbrc 592	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐹:(𝑋 / ∼ )–1-1→[𝐴]𝑂)
59		vex 3457	. . . . . . . . 9 ⊢ ℎ ∈ V
60		elecg 8718	. . . . . . . . 9 ⊢ ((ℎ ∈ V ∧ 𝐴 ∈ 𝑌) → (ℎ ∈ [𝐴]𝑂 ↔ 𝐴𝑂ℎ))
61	59, 6, 60	sylancr 596	. . . . . . . 8 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (ℎ ∈ [𝐴]𝑂 ↔ 𝐴𝑂ℎ))
62	18	gaorb 19330	. . . . . . . 8 ⊢ (𝐴𝑂ℎ ↔ (𝐴 ∈ 𝑌 ∧ ℎ ∈ 𝑌 ∧ ∃𝑤 ∈ 𝑋 (𝑤 ⊕ 𝐴) = ℎ))
63	61, 62	bitrdi 289	. . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (ℎ ∈ [𝐴]𝑂 ↔ (𝐴 ∈ 𝑌 ∧ ℎ ∈ 𝑌 ∧ ∃𝑤 ∈ 𝑋 (𝑤 ⊕ 𝐴) = ℎ)))
64	63	biimpa 480	. . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ ℎ ∈ [𝐴]𝑂) → (𝐴 ∈ 𝑌 ∧ ℎ ∈ 𝑌 ∧ ∃𝑤 ∈ 𝑋 (𝑤 ⊕ 𝐴) = ℎ))
65	64	simp3d 1156	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ ℎ ∈ [𝐴]𝑂) → ∃𝑤 ∈ 𝑋 (𝑤 ⊕ 𝐴) = ℎ)
66	3	ovexi 7426	. . . . . . . . . 10 ⊢ ∼ ∈ V
67	66	ecelqsi 8746	. . . . . . . . 9 ⊢ (𝑤 ∈ 𝑋 → [𝑤] ∼ ∈ (𝑋 / ∼ ))
68	43	eqcomd 2767	. . . . . . . . 9 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑤 ∈ 𝑋) → (𝑤 ⊕ 𝐴) = (𝐹‘[𝑤] ∼ ))
69		fveq2 6863	. . . . . . . . . 10 ⊢ (𝑧 = [𝑤] ∼ → (𝐹‘𝑧) = (𝐹‘[𝑤] ∼ ))
70	69	rspceeqv 3604	. . . . . . . . 9 ⊢ (([𝑤] ∼ ∈ (𝑋 / ∼ ) ∧ (𝑤 ⊕ 𝐴) = (𝐹‘[𝑤] ∼ )) → ∃𝑧 ∈ (𝑋 / ∼ )(𝑤 ⊕ 𝐴) = (𝐹‘𝑧))
71	67, 68, 70	syl2an2 696	. . . . . . . 8 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑤 ∈ 𝑋) → ∃𝑧 ∈ (𝑋 / ∼ )(𝑤 ⊕ 𝐴) = (𝐹‘𝑧))
72		eqeq1 2765	. . . . . . . . 9 ⊢ ((𝑤 ⊕ 𝐴) = ℎ → ((𝑤 ⊕ 𝐴) = (𝐹‘𝑧) ↔ ℎ = (𝐹‘𝑧)))
73	72	rexbidv 3185	. . . . . . . 8 ⊢ ((𝑤 ⊕ 𝐴) = ℎ → (∃𝑧 ∈ (𝑋 / ∼ )(𝑤 ⊕ 𝐴) = (𝐹‘𝑧) ↔ ∃𝑧 ∈ (𝑋 / ∼ )ℎ = (𝐹‘𝑧)))
74	71, 73	syl5ibcom 247	. . . . . . 7 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑤 ∈ 𝑋) → ((𝑤 ⊕ 𝐴) = ℎ → ∃𝑧 ∈ (𝑋 / ∼ )ℎ = (𝐹‘𝑧)))
75	74	rexlimdva 3162	. . . . . 6 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (∃𝑤 ∈ 𝑋 (𝑤 ⊕ 𝐴) = ℎ → ∃𝑧 ∈ (𝑋 / ∼ )ℎ = (𝐹‘𝑧)))
76	75	imp 410	. . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ ∃𝑤 ∈ 𝑋 (𝑤 ⊕ 𝐴) = ℎ) → ∃𝑧 ∈ (𝑋 / ∼ )ℎ = (𝐹‘𝑧))
77	65, 76	syldan 600	. . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ ℎ ∈ [𝐴]𝑂) → ∃𝑧 ∈ (𝑋 / ∼ )ℎ = (𝐹‘𝑧))
78	77	ralrimiva 3153	. . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → ∀ℎ ∈ [ 𝐴]𝑂∃𝑧 ∈ (𝑋 / ∼ )ℎ = (𝐹‘𝑧))
79		dffo3 7079	. . 3 ⊢ (𝐹:(𝑋 / ∼ )–onto→[𝐴]𝑂 ↔ (𝐹:(𝑋 / ∼ )⟶[𝐴]𝑂 ∧ ∀ℎ ∈ [ 𝐴]𝑂∃𝑧 ∈ (𝑋 / ∼ )ℎ = (𝐹‘𝑧)))
80	31, 78, 79	sylanbrc 592	. 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐹:(𝑋 / ∼ )–onto→[𝐴]𝑂)
81		df-f1o 6524	. 2 ⊢ (𝐹:(𝑋 / ∼ )–1-1-onto→[𝐴]𝑂 ↔ (𝐹:(𝑋 / ∼ )–1-1→[𝐴]𝑂 ∧ 𝐹:(𝑋 / ∼ )–onto→[𝐴]𝑂))
82	58, 80, 81	sylanbrc 592	1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐹:(𝑋 / ∼ )–1-1-onto→[𝐴]𝑂)

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   ∧ w3a 1097   = wceq 1559   ∈ wcel 2141  ∀wral 3075  ∃wrex 3085  {crab 3413  Vcvv 3453   ⊆ wss 3904  {cpr 4583  ⟨cop 4587   class class class wbr 5099  {copab 5161   ↦ cmpt 5180   × cxp 5643  ran crn 5646  Fun wfun 6511  ⟶wf 6513  –1-1→wf1 6514  –onto→wfo 6515  –1-1-onto→wf1o 6516  ‘cfv 6517  (class class class)co 7392   Er wer 8670  [cec 8671   / cqs 8672  Basecbs 17228  SubGrpcsubg 19145   ~_QG cqg 19147   GrpAct cga 19312

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714  ax-cnex 11126  ax-resscn 11127  ax-1cn 11128  ax-icn 11129  ax-addcl 11130  ax-addrcl 11131  ax-mulcl 11132  ax-mulrcl 11133  ax-mulcom 11134  ax-addass 11135  ax-mulass 11136  ax-distr 11137  ax-i2m1 11138  ax-1ne0 11139  ax-1rid 11140  ax-rnegex 11141  ax-rrecex 11142  ax-cnre 11143  ax-pre-lttri 11144  ax-pre-lttrn 11145  ax-pre-ltadd 11146  ax-pre-mulgt0 11147

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3061  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-pred 6284  df-ord 6345  df-on 6346  df-lim 6347  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-riota 7349  df-ov 7395  df-oprab 7396  df-mpo 7397  df-om 7843  df-1st 7966  df-2nd 7967  df-frecs 8257  df-wrecs 8288  df-recs 8337  df-rdg 8376  df-er 8673  df-ec 8675  df-qs 8679  df-map 8805  df-en 8924  df-dom 8925  df-sdom 8926  df-pnf 11215  df-mnf 11216  df-xr 11217  df-ltxr 11218  df-le 11219  df-sub 11413  df-neg 11414  df-nn 12208  df-2 12277  df-sets 17183  df-slot 17201  df-ndx 17213  df-base 17229  df-ress 17250  df-plusg 17282  df-0g 17453  df-mgm 18657  df-sgrp 18736  df-mnd 18752  df-grp 18961  df-minusg 18962  df-subg 19148  df-eqg 19150  df-ga 19313

This theorem is referenced by:  orbsta2  19337