Theorem mgcmnt2 33436

Description: The upper adjoint 𝐺 of a Galois connection is monotonically increasing. (Contributed by Thierry Arnoux, 26-Apr-2024.)

Hypotheses

Ref	Expression
mgcoval.1	⊢ 𝐴 = (Base‘𝑉)
mgcoval.2	⊢ 𝐵 = (Base‘𝑊)
mgcoval.3	⊢ ≤ = (le‘𝑉)
mgcoval.4	⊢ ≲ = (le‘𝑊)
mgcval.1	⊢ 𝐻 = (𝑉MGalConn𝑊)
mgcval.2	⊢ (𝜑 → 𝑉 ∈ Proset )
mgcval.3	⊢ (𝜑 → 𝑊 ∈ Proset )
mgccole.1	⊢ (𝜑 → 𝐹𝐻𝐺)
mgcmnt2.1	⊢ (𝜑 → 𝑋 ∈ 𝐵)
mgcmnt2.2	⊢ (𝜑 → 𝑌 ∈ 𝐵)
mgcmnt2.3	⊢ (𝜑 → 𝑋 ≲ 𝑌)

Assertion

Ref	Expression
mgcmnt2	⊢ (𝜑 → (𝐺‘𝑋) ≤ (𝐺‘𝑌))

Proof of Theorem mgcmnt2

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

Step	Hyp	Ref	Expression
1		mgcval.3	. . 3 ⊢ (𝜑 → 𝑊 ∈ Proset )
2		mgccole.1	. . . . . 6 ⊢ (𝜑 → 𝐹𝐻𝐺)
3		mgcoval.1	. . . . . . 7 ⊢ 𝐴 = (Base‘𝑉)
4		mgcoval.2	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑊)
5		mgcoval.3	. . . . . . 7 ⊢ ≤ = (le‘𝑉)
6		mgcoval.4	. . . . . . 7 ⊢ ≲ = (le‘𝑊)
7		mgcval.1	. . . . . . 7 ⊢ 𝐻 = (𝑉MGalConn𝑊)
8		mgcval.2	. . . . . . 7 ⊢ (𝜑 → 𝑉 ∈ Proset )
9	3, 4, 5, 6, 7, 8, 1	mgcval 33430	. . . . . 6 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))))
10	2, 9	mpbid 235	. . . . 5 ⊢ (𝜑 → ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦))))
11	10	simplld 780	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
12	10	simplrd 782	. . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
13		mgcmnt2.1	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
14	12, 13	ffvelcdmd 7079	. . . 4 ⊢ (𝜑 → (𝐺‘𝑋) ∈ 𝐴)
15	11, 14	ffvelcdmd 7079	. . 3 ⊢ (𝜑 → (𝐹‘(𝐺‘𝑋)) ∈ 𝐵)
16		mgcmnt2.2	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
17	3, 4, 5, 6, 7, 8, 1, 2, 13	mgccole2 33434	. . 3 ⊢ (𝜑 → (𝐹‘(𝐺‘𝑋)) ≲ 𝑋)
18		mgcmnt2.3	. . 3 ⊢ (𝜑 → 𝑋 ≲ 𝑌)
19	4, 6	prstr 18390	. . 3 ⊢ ((𝑊 ∈ Proset ∧ ((𝐹‘(𝐺‘𝑋)) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝐹‘(𝐺‘𝑋)) ≲ 𝑋 ∧ 𝑋 ≲ 𝑌)) → (𝐹‘(𝐺‘𝑋)) ≲ 𝑌)
20	1, 15, 13, 16, 17, 18, 19	syl132anc 1415	. 2 ⊢ (𝜑 → (𝐹‘(𝐺‘𝑋)) ≲ 𝑌)
21		breq2 5107	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝐹‘(𝐺‘𝑋)) ≲ 𝑦 ↔ (𝐹‘(𝐺‘𝑋)) ≲ 𝑌))
22		fveq2 6879	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝐺‘𝑦) = (𝐺‘𝑌))
23	22	breq2d 5115	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝐺‘𝑋) ≤ (𝐺‘𝑦) ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑌)))
24	21, 23	bibi12d 348	. . 3 ⊢ (𝑦 = 𝑌 → (((𝐹‘(𝐺‘𝑋)) ≲ 𝑦 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑦)) ↔ ((𝐹‘(𝐺‘𝑋)) ≲ 𝑌 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑌))))
25		fveq2 6879	. . . . . . 7 ⊢ (𝑥 = (𝐺‘𝑋) → (𝐹‘𝑥) = (𝐹‘(𝐺‘𝑋)))
26	25	breq1d 5113	. . . . . 6 ⊢ (𝑥 = (𝐺‘𝑋) → ((𝐹‘𝑥) ≲ 𝑦 ↔ (𝐹‘(𝐺‘𝑋)) ≲ 𝑦))
27		breq1 5106	. . . . . 6 ⊢ (𝑥 = (𝐺‘𝑋) → (𝑥 ≤ (𝐺‘𝑦) ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑦)))
28	26, 27	bibi12d 348	. . . . 5 ⊢ (𝑥 = (𝐺‘𝑋) → (((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ((𝐹‘(𝐺‘𝑋)) ≲ 𝑦 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑦))))
29	28	ralbidv 3185	. . . 4 ⊢ (𝑥 = (𝐺‘𝑋) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑋)) ≲ 𝑦 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑦))))
30	10	simprd 501	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))
31	29, 30, 14	rspcdva 3577	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑋)) ≲ 𝑦 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑦)))
32	24, 31, 16	rspcdva 3577	. 2 ⊢ (𝜑 → ((𝐹‘(𝐺‘𝑋)) ≲ 𝑌 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑌)))
33	20, 32	mpbid 235	1 ⊢ (𝜑 → (𝐺‘𝑋) ≤ (𝐺‘𝑌))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076   class class class wbr 5103  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414  Basecbs 17304  lecple 17352   Proset cproset 18383  MGalConncmgc 33422

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 8831  df-proset 18385  df-mgc 33424

This theorem is used by:  dfmgc2  33439  mgcf1olem2  33445