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

Theorem nsgqusf1olem2 33789
Description: Lemma for nsgqusf1o 33791. (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
nsgqusf1olem2 (𝜑 → ran 𝐸 = 𝑇)
Distinct variable groups:   ,𝑎,𝑓,,𝑥   𝐵,𝑎,𝑓,,𝑥   𝐸,𝑎,𝑓,,𝑥   𝑓,𝐹,,𝑥   𝐺,𝑎,𝑓,,𝑥   𝑁,𝑎,𝑓,,𝑥   𝑄,𝑎,𝑓,,𝑥   𝑆,𝑎,𝑓,,𝑥   𝑇,𝑎,𝑓,,𝑥   𝜑,𝑎,𝑓,,𝑥
Allowed substitution hints:   𝐹(𝑎)   (𝑥, 𝑓, , 𝑎)   (𝑥, 𝑓, , 𝑎)

Proof of Theorem nsgqusf1olem2
Dummy variable 𝑖 is distinct from all other variables.
StepHypRef Expression
1 simpr 490 . . . . . . 7 (((𝜑𝑆) ∧ 𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁))) → 𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁)))
2 nsgqusf1o.s . . . . . . . . . 10 𝑆 = { ∈ (SubGrp‘𝐺) ∣ 𝑁}
32reqabi 3441 . . . . . . . . 9 (𝑆 ↔ ( ∈ (SubGrp‘𝐺) ∧ 𝑁))
4 nsgqusf1o.b . . . . . . . . . . . 12 𝐵 = (Base‘𝐺)
5 nsgqusf1o.t . . . . . . . . . . . 12 𝑇 = (SubGrp‘𝑄)
6 nsgqusf1o.1 . . . . . . . . . . . 12 = (le‘(toInc‘𝑆))
7 nsgqusf1o.2 . . . . . . . . . . . 12 = (le‘(toInc‘𝑇))
8 nsgqusf1o.q . . . . . . . . . . . 12 𝑄 = (𝐺 /s (𝐺 ~QG 𝑁))
9 nsgqusf1o.p . . . . . . . . . . . 12 = (LSSum‘𝐺)
10 nsgqusf1o.e . . . . . . . . . . . 12 𝐸 = (𝑆 ↦ ran (𝑥 ↦ ({𝑥} 𝑁)))
11 nsgqusf1o.f . . . . . . . . . . . 12 𝐹 = (𝑓𝑇 ↦ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓})
12 nsgqusf1o.n . . . . . . . . . . . 12 (𝜑𝑁 ∈ (NrmSGrp‘𝐺))
134, 2, 5, 6, 7, 8, 9, 10, 11, 12nsgqusf1olem1 33788 . . . . . . . . . . 11 (((𝜑 ∈ (SubGrp‘𝐺)) ∧ 𝑁) → ran (𝑥 ↦ ({𝑥} 𝑁)) ∈ 𝑇)
1413anasss 472 . . . . . . . . . 10 ((𝜑 ∧ ( ∈ (SubGrp‘𝐺) ∧ 𝑁)) → ran (𝑥 ↦ ({𝑥} 𝑁)) ∈ 𝑇)
1514, 5eleqtrdi 2875 . . . . . . . . 9 ((𝜑 ∧ ( ∈ (SubGrp‘𝐺) ∧ 𝑁)) → ran (𝑥 ↦ ({𝑥} 𝑁)) ∈ (SubGrp‘𝑄))
163, 15sylan2b 606 . . . . . . . 8 ((𝜑𝑆) → ran (𝑥 ↦ ({𝑥} 𝑁)) ∈ (SubGrp‘𝑄))
1716adantr 486 . . . . . . 7 (((𝜑𝑆) ∧ 𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁))) → ran (𝑥 ↦ ({𝑥} 𝑁)) ∈ (SubGrp‘𝑄))
181, 17eqeltrd 2865 . . . . . 6 (((𝜑𝑆) ∧ 𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁))) → 𝑓 ∈ (SubGrp‘𝑄))
1918r19.29an 3171 . . . . 5 ((𝜑 ∧ ∃𝑆 𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁))) → 𝑓 ∈ (SubGrp‘𝑄))
20 sseq2 3964 . . . . . . . 8 ( = {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} → (𝑁𝑁 ⊆ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}))
2112adantr 486 . . . . . . . . 9 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → 𝑁 ∈ (NrmSGrp‘𝐺))
22 simpr 490 . . . . . . . . 9 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → 𝑓 ∈ (SubGrp‘𝑄))
234, 8, 9, 21, 22nsgmgclem 33786 . . . . . . . 8 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ∈ (SubGrp‘𝐺))
245eleq2i 2857 . . . . . . . . 9 (𝑓𝑇𝑓 ∈ (SubGrp‘𝑄))
25 nsgsubg 19270 . . . . . . . . . . . . 13 (𝑁 ∈ (NrmSGrp‘𝐺) → 𝑁 ∈ (SubGrp‘𝐺))
2612, 25syl 18 . . . . . . . . . . . 12 (𝜑𝑁 ∈ (SubGrp‘𝐺))
274subgss 19239 . . . . . . . . . . . 12 (𝑁 ∈ (SubGrp‘𝐺) → 𝑁𝐵)
2826, 27syl 18 . . . . . . . . . . 11 (𝜑𝑁𝐵)
2928adantr 486 . . . . . . . . . 10 ((𝜑𝑓𝑇) → 𝑁𝐵)
3026ad2antrr 739 . . . . . . . . . . . 12 (((𝜑𝑓𝑇) ∧ 𝑎𝑁) → 𝑁 ∈ (SubGrp‘𝐺))
319grplsmid 33779 . . . . . . . . . . . 12 ((𝑁 ∈ (SubGrp‘𝐺) ∧ 𝑎𝑁) → ({𝑎} 𝑁) = 𝑁)
3230, 31sylancom 600 . . . . . . . . . . 11 (((𝜑𝑓𝑇) ∧ 𝑎𝑁) → ({𝑎} 𝑁) = 𝑁)
3324biimpi 219 . . . . . . . . . . . . 13 (𝑓𝑇𝑓 ∈ (SubGrp‘𝑄))
348nsgqus0 33785 . . . . . . . . . . . . 13 ((𝑁 ∈ (NrmSGrp‘𝐺) ∧ 𝑓 ∈ (SubGrp‘𝑄)) → 𝑁𝑓)
3512, 33, 34syl2an 608 . . . . . . . . . . . 12 ((𝜑𝑓𝑇) → 𝑁𝑓)
3635adantr 486 . . . . . . . . . . 11 (((𝜑𝑓𝑇) ∧ 𝑎𝑁) → 𝑁𝑓)
3732, 36eqeltrd 2865 . . . . . . . . . 10 (((𝜑𝑓𝑇) ∧ 𝑎𝑁) → ({𝑎} 𝑁) ∈ 𝑓)
3829, 37ssrabdv 4028 . . . . . . . . 9 ((𝜑𝑓𝑇) → 𝑁 ⊆ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓})
3924, 38sylan2br 607 . . . . . . . 8 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → 𝑁 ⊆ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓})
4020, 23, 39elrabd 3654 . . . . . . 7 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ∈ { ∈ (SubGrp‘𝐺) ∣ 𝑁})
4140, 2eleqtrrdi 2876 . . . . . 6 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ∈ 𝑆)
42 mpteq1 5202 . . . . . . . . 9 ( = {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} → (𝑥 ↦ ({𝑥} 𝑁)) = (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↦ ({𝑥} 𝑁)))
4342rneqd 5930 . . . . . . . 8 ( = {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} → ran (𝑥 ↦ ({𝑥} 𝑁)) = ran (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↦ ({𝑥} 𝑁)))
4443eqeq2d 2776 . . . . . . 7 ( = {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} → (𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁)) ↔ 𝑓 = ran (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↦ ({𝑥} 𝑁))))
4544adantl 487 . . . . . 6 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ = {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}) → (𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁)) ↔ 𝑓 = ran (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↦ ({𝑥} 𝑁))))
46 eqid 2765 . . . . . . . . . . . . . . 15 (Base‘𝑄) = (Base‘𝑄)
4746subgss 19239 . . . . . . . . . . . . . 14 (𝑓 ∈ (SubGrp‘𝑄) → 𝑓 ⊆ (Base‘𝑄))
4847adantl 487 . . . . . . . . . . . . 13 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → 𝑓 ⊆ (Base‘𝑄))
4948sselda 3938 . . . . . . . . . . . 12 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → 𝑖 ∈ (Base‘𝑄))
508a1i 11 . . . . . . . . . . . . 13 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → 𝑄 = (𝐺 /s (𝐺 ~QG 𝑁)))
514a1i 11 . . . . . . . . . . . . 13 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → 𝐵 = (Base‘𝐺))
52 ovexd 7454 . . . . . . . . . . . . 13 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → (𝐺 ~QG 𝑁) ∈ V)
53 subgrcl 19243 . . . . . . . . . . . . . . 15 (𝑁 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
5426, 53syl 18 . . . . . . . . . . . . . 14 (𝜑𝐺 ∈ Grp)
5554ad2antrr 739 . . . . . . . . . . . . 13 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → 𝐺 ∈ Grp)
5650, 51, 52, 55qusbas 17623 . . . . . . . . . . . 12 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → (𝐵 / (𝐺 ~QG 𝑁)) = (Base‘𝑄))
5749, 56eleqtrrd 2868 . . . . . . . . . . 11 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → 𝑖 ∈ (𝐵 / (𝐺 ~QG 𝑁)))
58 elqsi 8769 . . . . . . . . . . 11 (𝑖 ∈ (𝐵 / (𝐺 ~QG 𝑁)) → ∃𝑥𝐵 𝑖 = [𝑥](𝐺 ~QG 𝑁))
5957, 58syl 18 . . . . . . . . . 10 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → ∃𝑥𝐵 𝑖 = [𝑥](𝐺 ~QG 𝑁))
60 sneq 4601 . . . . . . . . . . . . . . . 16 (𝑎 = 𝑥 → {𝑎} = {𝑥})
6160oveq1d 7434 . . . . . . . . . . . . . . 15 (𝑎 = 𝑥 → ({𝑎} 𝑁) = ({𝑥} 𝑁))
6261eleq1d 2850 . . . . . . . . . . . . . 14 (𝑎 = 𝑥 → (({𝑎} 𝑁) ∈ 𝑓 ↔ ({𝑥} 𝑁) ∈ 𝑓))
63 simplr 781 . . . . . . . . . . . . . 14 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) ∧ 𝑥𝐵) ∧ 𝑖 = [𝑥](𝐺 ~QG 𝑁)) → 𝑥𝐵)
64 simpr 490 . . . . . . . . . . . . . . . 16 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) ∧ 𝑥𝐵) ∧ 𝑖 = [𝑥](𝐺 ~QG 𝑁)) → 𝑖 = [𝑥](𝐺 ~QG 𝑁))
6526ad4antr 745 . . . . . . . . . . . . . . . . 17 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) ∧ 𝑥𝐵) ∧ 𝑖 = [𝑥](𝐺 ~QG 𝑁)) → 𝑁 ∈ (SubGrp‘𝐺))
664, 9, 65, 63quslsm 33780 . . . . . . . . . . . . . . . 16 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) ∧ 𝑥𝐵) ∧ 𝑖 = [𝑥](𝐺 ~QG 𝑁)) → [𝑥](𝐺 ~QG 𝑁) = ({𝑥} 𝑁))
6764, 66eqtrd 2800 . . . . . . . . . . . . . . 15 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) ∧ 𝑥𝐵) ∧ 𝑖 = [𝑥](𝐺 ~QG 𝑁)) → 𝑖 = ({𝑥} 𝑁))
68 simpllr 788 . . . . . . . . . . . . . . 15 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) ∧ 𝑥𝐵) ∧ 𝑖 = [𝑥](𝐺 ~QG 𝑁)) → 𝑖𝑓)
6967, 68eqeltrrd 2866 . . . . . . . . . . . . . 14 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) ∧ 𝑥𝐵) ∧ 𝑖 = [𝑥](𝐺 ~QG 𝑁)) → ({𝑥} 𝑁) ∈ 𝑓)
7062, 63, 69elrabd 3654 . . . . . . . . . . . . 13 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) ∧ 𝑥𝐵) ∧ 𝑖 = [𝑥](𝐺 ~QG 𝑁)) → 𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓})
7170, 67jca 521 . . . . . . . . . . . 12 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) ∧ 𝑥𝐵) ∧ 𝑖 = [𝑥](𝐺 ~QG 𝑁)) → (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ∧ 𝑖 = ({𝑥} 𝑁)))
7271expl 463 . . . . . . . . . . 11 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → ((𝑥𝐵𝑖 = [𝑥](𝐺 ~QG 𝑁)) → (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ∧ 𝑖 = ({𝑥} 𝑁))))
7372reximdv2 3177 . . . . . . . . . 10 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → (∃𝑥𝐵 𝑖 = [𝑥](𝐺 ~QG 𝑁) → ∃𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}𝑖 = ({𝑥} 𝑁)))
7459, 73mpd 16 . . . . . . . . 9 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖𝑓) → ∃𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}𝑖 = ({𝑥} 𝑁))
75 simplr 781 . . . . . . . . . . . 12 ((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}) ∧ 𝑖 = ({𝑥} 𝑁)) → 𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓})
7662elrab 3652 . . . . . . . . . . . 12 (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↔ (𝑥𝐵 ∧ ({𝑥} 𝑁) ∈ 𝑓))
7775, 76sylib 221 . . . . . . . . . . 11 ((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}) ∧ 𝑖 = ({𝑥} 𝑁)) → (𝑥𝐵 ∧ ({𝑥} 𝑁) ∈ 𝑓))
78 simpllr 788 . . . . . . . . . . . . . 14 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖 = ({𝑥} 𝑁)) ∧ 𝑥𝐵) ∧ ({𝑥} 𝑁) ∈ 𝑓) → 𝑖 = ({𝑥} 𝑁))
79 simpr 490 . . . . . . . . . . . . . 14 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖 = ({𝑥} 𝑁)) ∧ 𝑥𝐵) ∧ ({𝑥} 𝑁) ∈ 𝑓) → ({𝑥} 𝑁) ∈ 𝑓)
8078, 79eqeltrd 2865 . . . . . . . . . . . . 13 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖 = ({𝑥} 𝑁)) ∧ 𝑥𝐵) ∧ ({𝑥} 𝑁) ∈ 𝑓) → 𝑖𝑓)
8180anasss 472 . . . . . . . . . . . 12 ((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑖 = ({𝑥} 𝑁)) ∧ (𝑥𝐵 ∧ ({𝑥} 𝑁) ∈ 𝑓)) → 𝑖𝑓)
8281adantllr 732 . . . . . . . . . . 11 (((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}) ∧ 𝑖 = ({𝑥} 𝑁)) ∧ (𝑥𝐵 ∧ ({𝑥} 𝑁) ∈ 𝑓)) → 𝑖𝑓)
8377, 82mpdan 700 . . . . . . . . . 10 ((((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ 𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}) ∧ 𝑖 = ({𝑥} 𝑁)) → 𝑖𝑓)
8483r19.29an 3171 . . . . . . . . 9 (((𝜑𝑓 ∈ (SubGrp‘𝑄)) ∧ ∃𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}𝑖 = ({𝑥} 𝑁)) → 𝑖𝑓)
8574, 84impbida 813 . . . . . . . 8 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → (𝑖𝑓 ↔ ∃𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}𝑖 = ({𝑥} 𝑁)))
86 eqid 2765 . . . . . . . . . 10 (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↦ ({𝑥} 𝑁)) = (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↦ ({𝑥} 𝑁))
8786elrnmpt 5950 . . . . . . . . 9 (𝑖 ∈ V → (𝑖 ∈ ran (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↦ ({𝑥} 𝑁)) ↔ ∃𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}𝑖 = ({𝑥} 𝑁)))
8887elv 3462 . . . . . . . 8 (𝑖 ∈ ran (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↦ ({𝑥} 𝑁)) ↔ ∃𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓}𝑖 = ({𝑥} 𝑁))
8985, 88bitr4di 292 . . . . . . 7 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → (𝑖𝑓𝑖 ∈ ran (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↦ ({𝑥} 𝑁))))
9089eqrdv 2763 . . . . . 6 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → 𝑓 = ran (𝑥 ∈ {𝑎𝐵 ∣ ({𝑎} 𝑁) ∈ 𝑓} ↦ ({𝑥} 𝑁)))
9141, 45, 90rspcedvd 3585 . . . . 5 ((𝜑𝑓 ∈ (SubGrp‘𝑄)) → ∃𝑆 𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁)))
9219, 91impbida 813 . . . 4 (𝜑 → (∃𝑆 𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁)) ↔ 𝑓 ∈ (SubGrp‘𝑄)))
9392abbidv 2831 . . 3 (𝜑 → {𝑓 ∣ ∃𝑆 𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁))} = {𝑓𝑓 ∈ (SubGrp‘𝑄)})
9410rnmpt 5949 . . 3 ran 𝐸 = {𝑓 ∣ ∃𝑆 𝑓 = ran (𝑥 ↦ ({𝑥} 𝑁))}
95 abid1 2901 . . 3 (SubGrp‘𝑄) = {𝑓𝑓 ∈ (SubGrp‘𝑄)}
9693, 94, 953eqtr4g 2825 . 2 (𝜑 → ran 𝐸 = (SubGrp‘𝑄))
9796, 5eqtr4di 2818 1 (𝜑 → ran 𝐸 = 𝑇)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  {cab 2743  wrex 3091  {crab 3418  Vcvv 3457  wss 3906  {csn 4591  cmpt 5194  ran crn 5664  cfv 6540  (class class class)co 7419  [cec 8698   / cqs 8699  Basecbs 17293  lecple 17341   /s cqus 17583  toInccipo 18607  Grpcgrp 19046  SubGrpcsubg 19232  NrmSGrpcnsg 19233   ~QG cqg 19234  LSSumclsm 19750
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11173  ax-resscn 11174  ax-1cn 11175  ax-icn 11176  ax-addcl 11177  ax-addrcl 11178  ax-mulcl 11179  ax-mulrcl 11180  ax-mulcom 11181  ax-addass 11182  ax-mulass 11183  ax-distr 11184  ax-i2m1 11185  ax-1ne0 11186  ax-1rid 11187  ax-rnegex 11188  ax-rrecex 11189  ax-cnre 11190  ax-pre-lttri 11191  ax-pre-lttrn 11192  ax-pre-ltadd 11193  ax-pre-mulgt0 11194
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-tpos 8228  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-er 8700  df-ec 8702  df-qs 8706  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-sup 9409  df-inf 9410  df-pnf 11262  df-mnf 11263  df-xr 11264  df-ltxr 11265  df-le 11266  df-sub 11460  df-neg 11461  df-nn 12251  df-2 12320  df-3 12321  df-4 12322  df-5 12323  df-6 12324  df-7 12325  df-8 12326  df-9 12327  df-n0 12522  df-z 12609  df-dec 12730  df-uz 12881  df-fz 13554  df-struct 17231  df-sets 17248  df-slot 17266  df-ndx 17278  df-base 17294  df-ress 17315  df-plusg 17347  df-mulr 17348  df-sca 17350  df-vsca 17351  df-ip 17352  df-tset 17353  df-ple 17354  df-ds 17356  df-0g 17518  df-imas 17586  df-qus 17587  df-mgm 18722  df-sgrp 18811  df-mnd 18827  df-submnd 18881  df-grp 19049  df-minusg 19050  df-subg 19235  df-nsg 19236  df-eqg 19237  df-oppg 19462  df-lsm 19752
This theorem is used by:  nsgqusf1o  33791
  Copyright terms: Public domain W3C validator