Theorem mgcf1olem2 33033

Description: Property of a Galois connection, lemma for mgcf1o 33034. (Contributed by Thierry Arnoux, 26-Jul-2024.)

Hypotheses

Ref	Expression
mgcf1o.h	⊢ 𝐻 = (𝑉MGalConn𝑊)
mgcf1o.a	⊢ 𝐴 = (Base‘𝑉)
mgcf1o.b	⊢ 𝐵 = (Base‘𝑊)
mgcf1o.1	⊢ ≤ = (le‘𝑉)
mgcf1o.2	⊢ ≲ = (le‘𝑊)
mgcf1o.v	⊢ (𝜑 → 𝑉 ∈ Poset)
mgcf1o.w	⊢ (𝜑 → 𝑊 ∈ Poset)
mgcf1o.f	⊢ (𝜑 → 𝐹𝐻𝐺)
mgcf1olem2.1	⊢ (𝜑 → 𝑌 ∈ 𝐵)

Assertion

Ref	Expression
mgcf1olem2	⊢ (𝜑 → (𝐺‘(𝐹‘(𝐺‘𝑌))) = (𝐺‘𝑌))

Proof of Theorem mgcf1olem2

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

Step	Hyp	Ref	Expression
1		mgcf1o.v	. 2 ⊢ (𝜑 → 𝑉 ∈ Poset)
2		mgcf1o.f	. . . . 5 ⊢ (𝜑 → 𝐹𝐻𝐺)
3		mgcf1o.a	. . . . . 6 ⊢ 𝐴 = (Base‘𝑉)
4		mgcf1o.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑊)
5		mgcf1o.1	. . . . . 6 ⊢ ≤ = (le‘𝑉)
6		mgcf1o.2	. . . . . 6 ⊢ ≲ = (le‘𝑊)
7		mgcf1o.h	. . . . . 6 ⊢ 𝐻 = (𝑉MGalConn𝑊)
8		posprs 18237	. . . . . . 7 ⊢ (𝑉 ∈ Poset → 𝑉 ∈ Proset )
9	1, 8	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑉 ∈ Proset )
10		mgcf1o.w	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ Poset)
11		posprs 18237	. . . . . . 7 ⊢ (𝑊 ∈ Poset → 𝑊 ∈ Proset )
12	10, 11	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑊 ∈ Proset )
13	3, 4, 5, 6, 7, 9, 12	dfmgc2 33027	. . . . 5 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣))) ∧ (∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥)))))))
14	2, 13	mpbid 232	. . . 4 ⊢ (𝜑 → ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣))) ∧ (∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))))))
15	14	simplrd 769	. . 3 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
16	14	simplld 767	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
17		mgcf1olem2.1	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
18	15, 17	ffvelcdmd 7028	. . . 4 ⊢ (𝜑 → (𝐺‘𝑌) ∈ 𝐴)
19	16, 18	ffvelcdmd 7028	. . 3 ⊢ (𝜑 → (𝐹‘(𝐺‘𝑌)) ∈ 𝐵)
20	15, 19	ffvelcdmd 7028	. 2 ⊢ (𝜑 → (𝐺‘(𝐹‘(𝐺‘𝑌))) ∈ 𝐴)
21	3, 4, 5, 6, 7, 9, 12, 2, 17	mgccole2 33022	. . 3 ⊢ (𝜑 → (𝐹‘(𝐺‘𝑌)) ≲ 𝑌)
22	3, 4, 5, 6, 7, 9, 12, 2, 19, 17, 21	mgcmnt2 33024	. 2 ⊢ (𝜑 → (𝐺‘(𝐹‘(𝐺‘𝑌))) ≤ (𝐺‘𝑌))
23	3, 4, 5, 6, 7, 9, 12, 2, 18	mgccole1 33021	. 2 ⊢ (𝜑 → (𝐺‘𝑌) ≤ (𝐺‘(𝐹‘(𝐺‘𝑌))))
24	3, 5	posasymb 18240	. . 3 ⊢ ((𝑉 ∈ Poset ∧ (𝐺‘(𝐹‘(𝐺‘𝑌))) ∈ 𝐴 ∧ (𝐺‘𝑌) ∈ 𝐴) → (((𝐺‘(𝐹‘(𝐺‘𝑌))) ≤ (𝐺‘𝑌) ∧ (𝐺‘𝑌) ≤ (𝐺‘(𝐹‘(𝐺‘𝑌)))) ↔ (𝐺‘(𝐹‘(𝐺‘𝑌))) = (𝐺‘𝑌)))
25	24	biimpa 476	. 2 ⊢ (((𝑉 ∈ Poset ∧ (𝐺‘(𝐹‘(𝐺‘𝑌))) ∈ 𝐴 ∧ (𝐺‘𝑌) ∈ 𝐴) ∧ ((𝐺‘(𝐹‘(𝐺‘𝑌))) ≤ (𝐺‘𝑌) ∧ (𝐺‘𝑌) ≤ (𝐺‘(𝐹‘(𝐺‘𝑌))))) → (𝐺‘(𝐹‘(𝐺‘𝑌))) = (𝐺‘𝑌))
26	1, 20, 18, 22, 23, 25	syl32anc 1380	1 ⊢ (𝜑 → (𝐺‘(𝐹‘(𝐺‘𝑌))) = (𝐺‘𝑌))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3049   class class class wbr 5096  ⟶wf 6486  ‘cfv 6490  (class class class)co 7356  Basecbs 17134  lecple 17182   Proset cproset 18213  Posetcpo 18228  MGalConncmgc 33010

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-map 8763  df-proset 18215  df-poset 18234  df-mgc 33012

This theorem is referenced by:  mgcf1o  33034