Theorem eqgex 14026

Description: The left coset equivalence relation exists. (Contributed by Jim Kingdon, 25-Apr-2025.)

Assertion

Ref	Expression
eqgex	⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐺 ~QG 𝑆) ∈ V)

Proof of Theorem eqgex

Dummy variables 𝑖 𝑟 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 2833	. . . 4 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V)
2	1	adantr 276	. . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → 𝐺 ∈ V)
3		elex 2833	. . . 4 ⊢ (𝑆 ∈ 𝑊 → 𝑆 ∈ V)
4	3	adantl 277	. . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → 𝑆 ∈ V)
5		vex 2824	. . . . . . 7 ⊢ 𝑥 ∈ V
6		vex 2824	. . . . . . 7 ⊢ 𝑦 ∈ V
7	5, 6	prss 3871	. . . . . 6 ⊢ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐺))
8	7	anbi1i 462	. . . . 5 ⊢ (((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆) ↔ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆))
9	8	opabbii 4198	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)}
10		basfn 13413	. . . . . . 7 ⊢ Base Fn V
11		funfvex 5712	. . . . . . . 8 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V)
12	11	funfni 5483	. . . . . . 7 ⊢ ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V)
13	10, 2, 12	sylancr 418	. . . . . 6 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (Base‘𝐺) ∈ V)
14		xpexg 4889	. . . . . 6 ⊢ (((Base‘𝐺) ∈ V ∧ (Base‘𝐺) ∈ V) → ((Base‘𝐺) × (Base‘𝐺)) ∈ V)
15	13, 13, 14	syl2anc 415	. . . . 5 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → ((Base‘𝐺) × (Base‘𝐺)) ∈ V)
16		opabssxp 4849	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)} ⊆ ((Base‘𝐺) × (Base‘𝐺))
17	16	a1i 9	. . . . 5 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)} ⊆ ((Base‘𝐺) × (Base‘𝐺)))
18	15, 17	ssexd 4273	. . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝐺) ∧ 𝑦 ∈ (Base‘𝐺)) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)} ∈ V)
19	9, 18	eqeltrrid 2326	. . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)} ∈ V)
20		fveq2 5695	. . . . . . 7 ⊢ (𝑟 = 𝐺 → (Base‘𝑟) = (Base‘𝐺))
21	20	sseq2d 3278	. . . . . 6 ⊢ (𝑟 = 𝐺 → ({𝑥, 𝑦} ⊆ (Base‘𝑟) ↔ {𝑥, 𝑦} ⊆ (Base‘𝐺)))
22		fveq2 5695	. . . . . . . 8 ⊢ (𝑟 = 𝐺 → (+g‘𝑟) = (+g‘𝐺))
23		fveq2 5695	. . . . . . . . 9 ⊢ (𝑟 = 𝐺 → (invg‘𝑟) = (invg‘𝐺))
24	23	fveq1d 5697	. . . . . . . 8 ⊢ (𝑟 = 𝐺 → ((invg‘𝑟)‘𝑥) = ((invg‘𝐺)‘𝑥))
25		eqidd 2239	. . . . . . . 8 ⊢ (𝑟 = 𝐺 → 𝑦 = 𝑦)
26	22, 24, 25	oveq123d 6106	. . . . . . 7 ⊢ (𝑟 = 𝐺 → (((invg‘𝑟)‘𝑥)(+g‘𝑟)𝑦) = (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦))
27	26	eleq1d 2307	. . . . . 6 ⊢ (𝑟 = 𝐺 → ((((invg‘𝑟)‘𝑥)(+g‘𝑟)𝑦) ∈ 𝑖 ↔ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑖))
28	21, 27	anbi12d 477	. . . . 5 ⊢ (𝑟 = 𝐺 → (({𝑥, 𝑦} ⊆ (Base‘𝑟) ∧ (((invg‘𝑟)‘𝑥)(+g‘𝑟)𝑦) ∈ 𝑖) ↔ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑖)))
29	28	opabbidv 4197	. . . 4 ⊢ (𝑟 = 𝐺 → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝑟) ∧ (((invg‘𝑟)‘𝑥)(+g‘𝑟)𝑦) ∈ 𝑖)} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑖)})
30		eleq2 2302	. . . . . 6 ⊢ (𝑖 = 𝑆 → ((((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑖 ↔ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆))
31	30	anbi2d 468	. . . . 5 ⊢ (𝑖 = 𝑆 → (({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑖) ↔ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)))
32	31	opabbidv 4197	. . . 4 ⊢ (𝑖 = 𝑆 → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑖)} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)})
33		df-eqg 13977	. . . 4 ⊢ ~QG = (𝑟 ∈ V, 𝑖 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝑟) ∧ (((invg‘𝑟)‘𝑥)(+g‘𝑟)𝑦) ∈ 𝑖)})
34	29, 32, 33	ovmpog 6223	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝑆 ∈ V ∧ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)} ∈ V) → (𝐺 ~QG 𝑆) = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)})
35	2, 4, 19, 34	syl3anc 1278	. 2 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐺 ~QG 𝑆) = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (Base‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑆)})
36	35, 19	eqeltrd 2315	1 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑆 ∈ 𝑊) → (𝐺 ~QG 𝑆) ∈ V)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  Vcvv 2821   ⊆ wss 3220  {cpr 3710  {copab 4191   × cxp 4772   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085  Basecbs 13354  +_gcplusg 13433  inv_gcminusg 13808   ~_QG cqg 13974

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-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

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-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  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-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-inn 9306  df-ndx 13357  df-slot 13358  df-base 13360  df-eqg 13977

This theorem is used by:  quselbasg  14035  quseccl0g  14036  qusghm  14087  quscrng  14872  znval  14973  znle  14974  znbaslemnn  14976  znbas  14981  znzrhval  14984  znzrhfo  14985