Theorem mgcmnt2d 33658

Description: Galois connection implies monotonicity of the right adjoint. (Contributed by Thierry Arnoux, 21-Jul-2024.)

Hypotheses

Ref	Expression
mgcmntd.1	⊢ 𝐻 = (𝑉MGalConn𝑊)
mgcmntd.2	⊢ (𝜑 → 𝑉 ∈ Proset )
mgcmntd.3	⊢ (𝜑 → 𝑊 ∈ Proset )
mgcmntd.4	⊢ (𝜑 → 𝐹𝐻𝐺)

Assertion

Ref	Expression
mgcmnt2d	⊢ (𝜑 → 𝐺 ∈ (𝑊Monot𝑉))

Proof of Theorem mgcmnt2d

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

Step	Hyp	Ref	Expression
1		mgcmntd.3	. 2 ⊢ (𝜑 → 𝑊 ∈ Proset )
2		mgcmntd.2	. 2 ⊢ (𝜑 → 𝑉 ∈ Proset )
3		eqid 2763	. . 3 ⊢ (Base‘𝑉) = (Base‘𝑉)
4		eqid 2763	. . 3 ⊢ (Base‘𝑊) = (Base‘𝑊)
5		eqid 2763	. . 3 ⊢ (le‘𝑉) = (le‘𝑉)
6		eqid 2763	. . 3 ⊢ (le‘𝑊) = (le‘𝑊)
7		mgcmntd.1	. . 3 ⊢ 𝐻 = (𝑉MGalConn𝑊)
8		mgcmntd.4	. . 3 ⊢ (𝜑 → 𝐹𝐻𝐺)
9	3, 4, 5, 6, 7, 2, 1, 8	mgcf2 33649	. 2 ⊢ (𝜑 → 𝐺:(Base‘𝑊)⟶(Base‘𝑉))
10	3, 4, 5, 6, 7, 2, 1	dfmgc2 33656	. . . . 5 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:(Base‘𝑉)⟶(Base‘𝑊) ∧ 𝐺:(Base‘𝑊)⟶(Base‘𝑉)) ∧ ((∀𝑥 ∈ (Base‘𝑉)∀𝑦 ∈ (Base‘𝑉)(𝑥(le‘𝑉)𝑦 → (𝐹‘𝑥)(le‘𝑊)(𝐹‘𝑦)) ∧ ∀𝑢 ∈ (Base‘𝑊)∀𝑣 ∈ (Base‘𝑊)(𝑢(le‘𝑊)𝑣 → (𝐺‘𝑢)(le‘𝑉)(𝐺‘𝑣))) ∧ (∀𝑢 ∈ (Base‘𝑊)(𝐹‘(𝐺‘𝑢))(le‘𝑊)𝑢 ∧ ∀𝑥 ∈ (Base‘𝑉)𝑥(le‘𝑉)(𝐺‘(𝐹‘𝑥)))))))
11	8, 10	mpbid 235	. . . 4 ⊢ (𝜑 → ((𝐹:(Base‘𝑉)⟶(Base‘𝑊) ∧ 𝐺:(Base‘𝑊)⟶(Base‘𝑉)) ∧ ((∀𝑥 ∈ (Base‘𝑉)∀𝑦 ∈ (Base‘𝑉)(𝑥(le‘𝑉)𝑦 → (𝐹‘𝑥)(le‘𝑊)(𝐹‘𝑦)) ∧ ∀𝑢 ∈ (Base‘𝑊)∀𝑣 ∈ (Base‘𝑊)(𝑢(le‘𝑊)𝑣 → (𝐺‘𝑢)(le‘𝑉)(𝐺‘𝑣))) ∧ (∀𝑢 ∈ (Base‘𝑊)(𝐹‘(𝐺‘𝑢))(le‘𝑊)𝑢 ∧ ∀𝑥 ∈ (Base‘𝑉)𝑥(le‘𝑉)(𝐺‘(𝐹‘𝑥))))))
12	11	simprld 784	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ (Base‘𝑉)∀𝑦 ∈ (Base‘𝑉)(𝑥(le‘𝑉)𝑦 → (𝐹‘𝑥)(le‘𝑊)(𝐹‘𝑦)) ∧ ∀𝑢 ∈ (Base‘𝑊)∀𝑣 ∈ (Base‘𝑊)(𝑢(le‘𝑊)𝑣 → (𝐺‘𝑢)(le‘𝑉)(𝐺‘𝑣))))
13	12	simprd 501	. 2 ⊢ (𝜑 → ∀𝑢 ∈ (Base‘𝑊)∀𝑣 ∈ (Base‘𝑊)(𝑢(le‘𝑊)𝑣 → (𝐺‘𝑢)(le‘𝑉)(𝐺‘𝑣)))
14	4, 3, 6, 5	ismnt 33643	. . 3 ⊢ ((𝑊 ∈ Proset ∧ 𝑉 ∈ Proset ) → (𝐺 ∈ (𝑊Monot𝑉) ↔ (𝐺:(Base‘𝑊)⟶(Base‘𝑉) ∧ ∀𝑢 ∈ (Base‘𝑊)∀𝑣 ∈ (Base‘𝑊)(𝑢(le‘𝑊)𝑣 → (𝐺‘𝑢)(le‘𝑉)(𝐺‘𝑣)))))
15	14	biimpar 483	. 2 ⊢ (((𝑊 ∈ Proset ∧ 𝑉 ∈ Proset ) ∧ (𝐺:(Base‘𝑊)⟶(Base‘𝑉) ∧ ∀𝑢 ∈ (Base‘𝑊)∀𝑣 ∈ (Base‘𝑊)(𝑢(le‘𝑊)𝑣 → (𝐺‘𝑢)(le‘𝑉)(𝐺‘𝑣)))) → 𝐺 ∈ (𝑊Monot𝑉))
16	1, 2, 9, 13, 15	syl22anc 852	1 ⊢ (𝜑 → 𝐺 ∈ (𝑊Monot𝑉))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   class class class wbr 5108  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  lecple 17479   Proset cproset 18516  Monotcmnt 33638  MGalConncmgc 33639

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-proset 18518  df-mnt 33640  df-mgc 33641

This theorem is used by:  mgcf1o  33663