Theorem mhmf1o 13830

Description: A monoid homomorphism is bijective iff its converse is also a monoid homomorphism. (Contributed by AV, 22-Oct-2019.)

Hypotheses

Ref	Expression
mhmf1o.b	⊢ 𝐵 = (Base‘𝑅)
mhmf1o.c	⊢ 𝐶 = (Base‘𝑆)

Assertion

Ref	Expression
mhmf1o	⊢ (𝐹 ∈ (𝑅 MndHom 𝑆) → (𝐹:𝐵–1-1-onto→𝐶 ↔ ◡𝐹 ∈ (𝑆 MndHom 𝑅)))

Proof of Theorem mhmf1o

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

Step	Hyp	Ref	Expression
1		mhmrcl2 13824	. . . . 5 ⊢ (𝐹 ∈ (𝑅 MndHom 𝑆) → 𝑆 ∈ Mnd)
2		mhmrcl1 13823	. . . . 5 ⊢ (𝐹 ∈ (𝑅 MndHom 𝑆) → 𝑅 ∈ Mnd)
3	1, 2	jca 306	. . . 4 ⊢ (𝐹 ∈ (𝑅 MndHom 𝑆) → (𝑆 ∈ Mnd ∧ 𝑅 ∈ Mnd))
4	3	adantr 276	. . 3 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → (𝑆 ∈ Mnd ∧ 𝑅 ∈ Mnd))
5		f1ocnv 5652	. . . . . 6 ⊢ (𝐹:𝐵–1-1-onto→𝐶 → ◡𝐹:𝐶–1-1-onto→𝐵)
6	5	adantl 277	. . . . 5 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → ◡𝐹:𝐶–1-1-onto→𝐵)
7		f1of 5639	. . . . 5 ⊢ (◡𝐹:𝐶–1-1-onto→𝐵 → ◡𝐹:𝐶⟶𝐵)
8	6, 7	syl 14	. . . 4 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → ◡𝐹:𝐶⟶𝐵)
9		simpll 531	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → 𝐹 ∈ (𝑅 MndHom 𝑆))
10	8	adantr 276	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → ◡𝐹:𝐶⟶𝐵)
11		simprl 535	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → 𝑥 ∈ 𝐶)
12	10, 11	ffvelcdmd 5844	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (◡𝐹‘𝑥) ∈ 𝐵)
13		simprr 537	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → 𝑦 ∈ 𝐶)
14	10, 13	ffvelcdmd 5844	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (◡𝐹‘𝑦) ∈ 𝐵)
15		mhmf1o.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑅)
16		eqid 2238	. . . . . . . . 9 ⊢ (+g‘𝑅) = (+g‘𝑅)
17		eqid 2238	. . . . . . . . 9 ⊢ (+g‘𝑆) = (+g‘𝑆)
18	15, 16, 17	mhmlin 13827	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ (◡𝐹‘𝑥) ∈ 𝐵 ∧ (◡𝐹‘𝑦) ∈ 𝐵) → (𝐹‘((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦))) = ((𝐹‘(◡𝐹‘𝑥))(+g‘𝑆)(𝐹‘(◡𝐹‘𝑦))))
19	9, 12, 14, 18	syl3anc 1278	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝐹‘((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦))) = ((𝐹‘(◡𝐹‘𝑥))(+g‘𝑆)(𝐹‘(◡𝐹‘𝑦))))
20		simpr 110	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → 𝐹:𝐵–1-1-onto→𝐶)
21	20	adantr 276	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → 𝐹:𝐵–1-1-onto→𝐶)
22		f1ocnvfv2 5984	. . . . . . . . 9 ⊢ ((𝐹:𝐵–1-1-onto→𝐶 ∧ 𝑥 ∈ 𝐶) → (𝐹‘(◡𝐹‘𝑥)) = 𝑥)
23	21, 11, 22	syl2anc 415	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝐹‘(◡𝐹‘𝑥)) = 𝑥)
24		f1ocnvfv2 5984	. . . . . . . . 9 ⊢ ((𝐹:𝐵–1-1-onto→𝐶 ∧ 𝑦 ∈ 𝐶) → (𝐹‘(◡𝐹‘𝑦)) = 𝑦)
25	21, 13, 24	syl2anc 415	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝐹‘(◡𝐹‘𝑦)) = 𝑦)
26	23, 25	oveq12d 6103	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → ((𝐹‘(◡𝐹‘𝑥))(+g‘𝑆)(𝐹‘(◡𝐹‘𝑦))) = (𝑥(+g‘𝑆)𝑦))
27	19, 26	eqtrd 2271	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (𝐹‘((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦))) = (𝑥(+g‘𝑆)𝑦))
28	2	adantr 276	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → 𝑅 ∈ Mnd)
29	28	adantr 276	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → 𝑅 ∈ Mnd)
30	15, 16	mndcl 13789	. . . . . . . 8 ⊢ ((𝑅 ∈ Mnd ∧ (◡𝐹‘𝑥) ∈ 𝐵 ∧ (◡𝐹‘𝑦) ∈ 𝐵) → ((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦)) ∈ 𝐵)
31	29, 12, 14, 30	syl3anc 1278	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → ((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦)) ∈ 𝐵)
32		f1ocnvfv 5985	. . . . . . 7 ⊢ ((𝐹:𝐵–1-1-onto→𝐶 ∧ ((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦)) ∈ 𝐵) → ((𝐹‘((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦))) = (𝑥(+g‘𝑆)𝑦) → (◡𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦))))
33	21, 31, 32	syl2anc 415	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → ((𝐹‘((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦))) = (𝑥(+g‘𝑆)𝑦) → (◡𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦))))
34	27, 33	mpd 13	. . . . 5 ⊢ (((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶)) → (◡𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦)))
35	34	ralrimivva 2632	. . . 4 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐶 (◡𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦)))
36		eqid 2238	. . . . . . . . 9 ⊢ (0g‘𝑅) = (0g‘𝑅)
37		eqid 2238	. . . . . . . . 9 ⊢ (0g‘𝑆) = (0g‘𝑆)
38	36, 37	mhm0 13828	. . . . . . . 8 ⊢ (𝐹 ∈ (𝑅 MndHom 𝑆) → (𝐹‘(0g‘𝑅)) = (0g‘𝑆))
39	38	adantr 276	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → (𝐹‘(0g‘𝑅)) = (0g‘𝑆))
40	39	eqcomd 2244	. . . . . 6 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → (0g‘𝑆) = (𝐹‘(0g‘𝑅)))
41	40	fveq2d 5699	. . . . 5 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → (◡𝐹‘(0g‘𝑆)) = (◡𝐹‘(𝐹‘(0g‘𝑅))))
42	15, 36	mndidcl 13796	. . . . . . . 8 ⊢ (𝑅 ∈ Mnd → (0g‘𝑅) ∈ 𝐵)
43	2, 42	syl 14	. . . . . . 7 ⊢ (𝐹 ∈ (𝑅 MndHom 𝑆) → (0g‘𝑅) ∈ 𝐵)
44	43	adantr 276	. . . . . 6 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → (0g‘𝑅) ∈ 𝐵)
45		f1ocnvfv1 5983	. . . . . 6 ⊢ ((𝐹:𝐵–1-1-onto→𝐶 ∧ (0g‘𝑅) ∈ 𝐵) → (◡𝐹‘(𝐹‘(0g‘𝑅))) = (0g‘𝑅))
46	20, 44, 45	syl2anc 415	. . . . 5 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → (◡𝐹‘(𝐹‘(0g‘𝑅))) = (0g‘𝑅))
47	41, 46	eqtrd 2271	. . . 4 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → (◡𝐹‘(0g‘𝑆)) = (0g‘𝑅))
48	8, 35, 47	3jca 1208	. . 3 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → (◡𝐹:𝐶⟶𝐵 ∧ ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐶 (◡𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦)) ∧ (◡𝐹‘(0g‘𝑆)) = (0g‘𝑅)))
49		mhmf1o.c	. . . 4 ⊢ 𝐶 = (Base‘𝑆)
50	49, 15, 17, 16, 37, 36	ismhm 13821	. . 3 ⊢ (◡𝐹 ∈ (𝑆 MndHom 𝑅) ↔ ((𝑆 ∈ Mnd ∧ 𝑅 ∈ Mnd) ∧ (◡𝐹:𝐶⟶𝐵 ∧ ∀𝑥 ∈ 𝐶 ∀𝑦 ∈ 𝐶 (◡𝐹‘(𝑥(+g‘𝑆)𝑦)) = ((◡𝐹‘𝑥)(+g‘𝑅)(◡𝐹‘𝑦)) ∧ (◡𝐹‘(0g‘𝑆)) = (0g‘𝑅))))
51	4, 48, 50	sylanbrc 421	. 2 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ 𝐹:𝐵–1-1-onto→𝐶) → ◡𝐹 ∈ (𝑆 MndHom 𝑅))
52	15, 49	mhmf 13825	. . . . 5 ⊢ (𝐹 ∈ (𝑅 MndHom 𝑆) → 𝐹:𝐵⟶𝐶)
53	52	adantr 276	. . . 4 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 MndHom 𝑅)) → 𝐹:𝐵⟶𝐶)
54	53	ffnd 5534	. . 3 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 MndHom 𝑅)) → 𝐹 Fn 𝐵)
55	49, 15	mhmf 13825	. . . . 5 ⊢ (◡𝐹 ∈ (𝑆 MndHom 𝑅) → ◡𝐹:𝐶⟶𝐵)
56	55	adantl 277	. . . 4 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 MndHom 𝑅)) → ◡𝐹:𝐶⟶𝐵)
57	56	ffnd 5534	. . 3 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 MndHom 𝑅)) → ◡𝐹 Fn 𝐶)
58		dff1o4 5647	. . 3 ⊢ (𝐹:𝐵–1-1-onto→𝐶 ↔ (𝐹 Fn 𝐵 ∧ ◡𝐹 Fn 𝐶))
59	54, 57, 58	sylanbrc 421	. 2 ⊢ ((𝐹 ∈ (𝑅 MndHom 𝑆) ∧ ◡𝐹 ∈ (𝑆 MndHom 𝑅)) → 𝐹:𝐵–1-1-onto→𝐶)
60	51, 59	impbida 604	1 ⊢ (𝐹 ∈ (𝑅 MndHom 𝑆) → (𝐹:𝐵–1-1-onto→𝐶 ↔ ◡𝐹 ∈ (𝑆 MndHom 𝑅)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ^◡ccnv 4773   Fn wfn 5372  ⟶wf 5373  –1-1-onto→wf1o 5376  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  +_gcplusg 13484  0_gc0g 13663  Mndcmnd 13782   MndHom cmhm 13817

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 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277

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-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-iun 4014  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-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-map 6924  df-inn 9308  df-2 9366  df-ndx 13407  df-slot 13408  df-base 13410  df-plusg 13497  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-mhm 13819

This theorem is used by:  rhmf1o  14559