Theorem gicsubgen 19154

Description: A less trivial example of a group invariant: cardinality of the subgroup lattice. (Contributed by Stefan O'Rear, 25-Jan-2015.)

Assertion

Ref	Expression
gicsubgen	⊢ (𝑅 ≃𝑔 𝑆 → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))

Proof of Theorem gicsubgen

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		brgic 19145	. . 3 ⊢ (𝑅 ≃𝑔 𝑆 ↔ (𝑅 GrpIso 𝑆) ≠ ∅)
2		n0 4346	. . 3 ⊢ ((𝑅 GrpIso 𝑆) ≠ ∅ ↔ ∃𝑎 𝑎 ∈ (𝑅 GrpIso 𝑆))
3	1, 2	bitri 274	. 2 ⊢ (𝑅 ≃𝑔 𝑆 ↔ ∃𝑎 𝑎 ∈ (𝑅 GrpIso 𝑆))
4		fvexd 6906	. . . 4 ⊢ (𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑅) ∈ V)
5		fvexd 6906	. . . 4 ⊢ (𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑆) ∈ V)
6		vex 3478	. . . . . 6 ⊢ 𝑎 ∈ V
7	6	imaex 7909	. . . . 5 ⊢ (𝑎 “ 𝑏) ∈ V
8	7	2a1i 12	. . . 4 ⊢ (𝑎 ∈ (𝑅 GrpIso 𝑆) → (𝑏 ∈ (SubGrp‘𝑅) → (𝑎 “ 𝑏) ∈ V))
9	6	cnvex 7918	. . . . . 6 ⊢ ◡𝑎 ∈ V
10	9	imaex 7909	. . . . 5 ⊢ (◡𝑎 “ 𝑐) ∈ V
11	10	2a1i 12	. . . 4 ⊢ (𝑎 ∈ (𝑅 GrpIso 𝑆) → (𝑐 ∈ (SubGrp‘𝑆) → (◡𝑎 “ 𝑐) ∈ V))
12		gimghm 19140	. . . . . . . . 9 ⊢ (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎 ∈ (𝑅 GrpHom 𝑆))
13		ghmima 19115	. . . . . . . . 9 ⊢ ((𝑎 ∈ (𝑅 GrpHom 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (𝑎 “ 𝑏) ∈ (SubGrp‘𝑆))
14	12, 13	sylan 580	. . . . . . . 8 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (𝑎 “ 𝑏) ∈ (SubGrp‘𝑆))
15		eqid 2732	. . . . . . . . . . . 12 ⊢ (Base‘𝑅) = (Base‘𝑅)
16		eqid 2732	. . . . . . . . . . . 12 ⊢ (Base‘𝑆) = (Base‘𝑆)
17	15, 16	gimf1o 19139	. . . . . . . . . . 11 ⊢ (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎:(Base‘𝑅)–1-1-onto→(Base‘𝑆))
18		f1of1 6832	. . . . . . . . . . 11 ⊢ (𝑎:(Base‘𝑅)–1-1-onto→(Base‘𝑆) → 𝑎:(Base‘𝑅)–1-1→(Base‘𝑆))
19	17, 18	syl 17	. . . . . . . . . 10 ⊢ (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎:(Base‘𝑅)–1-1→(Base‘𝑆))
20	15	subgss 19009	. . . . . . . . . 10 ⊢ (𝑏 ∈ (SubGrp‘𝑅) → 𝑏 ⊆ (Base‘𝑅))
21		f1imacnv 6849	. . . . . . . . . 10 ⊢ ((𝑎:(Base‘𝑅)–1-1→(Base‘𝑆) ∧ 𝑏 ⊆ (Base‘𝑅)) → (◡𝑎 “ (𝑎 “ 𝑏)) = 𝑏)
22	19, 20, 21	syl2an 596	. . . . . . . . 9 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (◡𝑎 “ (𝑎 “ 𝑏)) = 𝑏)
23	22	eqcomd 2738	. . . . . . . 8 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → 𝑏 = (◡𝑎 “ (𝑎 “ 𝑏)))
24	14, 23	jca 512	. . . . . . 7 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → ((𝑎 “ 𝑏) ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ (𝑎 “ 𝑏))))
25		eleq1 2821	. . . . . . . 8 ⊢ (𝑐 = (𝑎 “ 𝑏) → (𝑐 ∈ (SubGrp‘𝑆) ↔ (𝑎 “ 𝑏) ∈ (SubGrp‘𝑆)))
26		imaeq2 6055	. . . . . . . . 9 ⊢ (𝑐 = (𝑎 “ 𝑏) → (◡𝑎 “ 𝑐) = (◡𝑎 “ (𝑎 “ 𝑏)))
27	26	eqeq2d 2743	. . . . . . . 8 ⊢ (𝑐 = (𝑎 “ 𝑏) → (𝑏 = (◡𝑎 “ 𝑐) ↔ 𝑏 = (◡𝑎 “ (𝑎 “ 𝑏))))
28	25, 27	anbi12d 631	. . . . . . 7 ⊢ (𝑐 = (𝑎 “ 𝑏) → ((𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ 𝑐)) ↔ ((𝑎 “ 𝑏) ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ (𝑎 “ 𝑏)))))
29	24, 28	syl5ibrcom 246	. . . . . 6 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑏 ∈ (SubGrp‘𝑅)) → (𝑐 = (𝑎 “ 𝑏) → (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ 𝑐))))
30	29	impr 455	. . . . 5 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ (𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ 𝑏))) → (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ 𝑐)))
31		ghmpreima 19116	. . . . . . . . 9 ⊢ ((𝑎 ∈ (𝑅 GrpHom 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (◡𝑎 “ 𝑐) ∈ (SubGrp‘𝑅))
32	12, 31	sylan 580	. . . . . . . 8 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (◡𝑎 “ 𝑐) ∈ (SubGrp‘𝑅))
33		f1ofo 6840	. . . . . . . . . . 11 ⊢ (𝑎:(Base‘𝑅)–1-1-onto→(Base‘𝑆) → 𝑎:(Base‘𝑅)–onto→(Base‘𝑆))
34	17, 33	syl 17	. . . . . . . . . 10 ⊢ (𝑎 ∈ (𝑅 GrpIso 𝑆) → 𝑎:(Base‘𝑅)–onto→(Base‘𝑆))
35	16	subgss 19009	. . . . . . . . . 10 ⊢ (𝑐 ∈ (SubGrp‘𝑆) → 𝑐 ⊆ (Base‘𝑆))
36		foimacnv 6850	. . . . . . . . . 10 ⊢ ((𝑎:(Base‘𝑅)–onto→(Base‘𝑆) ∧ 𝑐 ⊆ (Base‘𝑆)) → (𝑎 “ (◡𝑎 “ 𝑐)) = 𝑐)
37	34, 35, 36	syl2an 596	. . . . . . . . 9 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (𝑎 “ (◡𝑎 “ 𝑐)) = 𝑐)
38	37	eqcomd 2738	. . . . . . . 8 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → 𝑐 = (𝑎 “ (◡𝑎 “ 𝑐)))
39	32, 38	jca 512	. . . . . . 7 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → ((◡𝑎 “ 𝑐) ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ (◡𝑎 “ 𝑐))))
40		eleq1 2821	. . . . . . . 8 ⊢ (𝑏 = (◡𝑎 “ 𝑐) → (𝑏 ∈ (SubGrp‘𝑅) ↔ (◡𝑎 “ 𝑐) ∈ (SubGrp‘𝑅)))
41		imaeq2 6055	. . . . . . . . 9 ⊢ (𝑏 = (◡𝑎 “ 𝑐) → (𝑎 “ 𝑏) = (𝑎 “ (◡𝑎 “ 𝑐)))
42	41	eqeq2d 2743	. . . . . . . 8 ⊢ (𝑏 = (◡𝑎 “ 𝑐) → (𝑐 = (𝑎 “ 𝑏) ↔ 𝑐 = (𝑎 “ (◡𝑎 “ 𝑐))))
43	40, 42	anbi12d 631	. . . . . . 7 ⊢ (𝑏 = (◡𝑎 “ 𝑐) → ((𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ 𝑏)) ↔ ((◡𝑎 “ 𝑐) ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ (◡𝑎 “ 𝑐)))))
44	39, 43	syl5ibrcom 246	. . . . . 6 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ 𝑐 ∈ (SubGrp‘𝑆)) → (𝑏 = (◡𝑎 “ 𝑐) → (𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ 𝑏))))
45	44	impr 455	. . . . 5 ⊢ ((𝑎 ∈ (𝑅 GrpIso 𝑆) ∧ (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ 𝑐))) → (𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ 𝑏)))
46	30, 45	impbida 799	. . . 4 ⊢ (𝑎 ∈ (𝑅 GrpIso 𝑆) → ((𝑏 ∈ (SubGrp‘𝑅) ∧ 𝑐 = (𝑎 “ 𝑏)) ↔ (𝑐 ∈ (SubGrp‘𝑆) ∧ 𝑏 = (◡𝑎 “ 𝑐))))
47	4, 5, 8, 11, 46	en2d 8986	. . 3 ⊢ (𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))
48	47	exlimiv 1933	. 2 ⊢ (∃𝑎 𝑎 ∈ (𝑅 GrpIso 𝑆) → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))
49	3, 48	sylbi 216	1 ⊢ (𝑅 ≃𝑔 𝑆 → (SubGrp‘𝑅) ≈ (SubGrp‘𝑆))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541  ∃wex 1781   ∈ wcel 2106   ≠ wne 2940  Vcvv 3474   ⊆ wss 3948  ∅c0 4322   class class class wbr 5148  ^◡ccnv 5675   “ cima 5679  –1-1→wf1 6540  –onto→wfo 6541  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7411   ≈ cen 8938  Basecbs 17146  SubGrpcsubg 19002   GrpHom cghm 19091   GrpIso cgim 19133   ≃_𝑔 cgic 19134

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-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7727  ax-cnex 11168  ax-resscn 11169  ax-1cn 11170  ax-icn 11171  ax-addcl 11172  ax-addrcl 11173  ax-mulcl 11174  ax-mulrcl 11175  ax-mulcom 11176  ax-addass 11177  ax-mulass 11178  ax-distr 11179  ax-i2m1 11180  ax-1ne0 11181  ax-1rid 11182  ax-rnegex 11183  ax-rrecex 11184  ax-cnre 11185  ax-pre-lttri 11186  ax-pre-lttrn 11187  ax-pre-ltadd 11188  ax-pre-mulgt0 11189

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  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-nel 3047  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-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  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-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7367  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7858  df-1st 7977  df-2nd 7978  df-frecs 8268  df-wrecs 8299  df-recs 8373  df-rdg 8412  df-1o 8468  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-pnf 11252  df-mnf 11253  df-xr 11254  df-ltxr 11255  df-le 11256  df-sub 11448  df-neg 11449  df-nn 12215  df-2 12277  df-sets 17099  df-slot 17117  df-ndx 17129  df-base 17147  df-ress 17176  df-plusg 17212  df-0g 17389  df-mgm 18563  df-sgrp 18612  df-mnd 18628  df-grp 18824  df-minusg 18825  df-subg 19005  df-ghm 19092  df-gim 19135  df-gic 19136

This theorem is referenced by: (None)