Theorem mgcmnt2d 33439

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 2760	. . 3 ⊢ (Base‘𝑉) = (Base‘𝑉)
4		eqid 2760	. . 3 ⊢ (Base‘𝑊) = (Base‘𝑊)
5		eqid 2760	. . 3 ⊢ (le‘𝑉) = (le‘𝑉)
6		eqid 2760	. . 3 ⊢ (le‘𝑊) = (le‘𝑊)
7		mgcmntd.1	. . 3 ⊢ 𝐻 = (𝑉MGalConn𝑊)
8		mgcmntd.4	. . 3 ⊢ (𝜑 → 𝐹𝐻𝐺)
9	3, 4, 5, 6, 7, 2, 1, 8	mgcf2 33430	. 2 ⊢ (𝜑 → 𝐺:(Base‘𝑊)⟶(Base‘𝑉))
10	3, 4, 5, 6, 7, 2, 1	dfmgc2 33437	. . . . 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 33424	. . 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 2145  ∀wral 3076   class class class wbr 5103  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414  Basecbs 17302  lecple 17350   Proset cproset 18381  Monotcmnt 33419  MGalConncmgc 33420

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-map 8829  df-proset 18383  df-mnt 33421  df-mgc 33422

This theorem is used by:  mgcf1o  33444