Theorem mgcmnt2 32966

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 32960	. . . . . 6 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))))
10	2, 9	mpbid 232	. . . . 5 ⊢ (𝜑 → ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦))))
11	10	simplld 767	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
12	10	simplrd 769	. . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
13		mgcmnt2.1	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
14	12, 13	ffvelcdmd 7119	. . . 4 ⊢ (𝜑 → (𝐺‘𝑋) ∈ 𝐴)
15	11, 14	ffvelcdmd 7119	. . 3 ⊢ (𝜑 → (𝐹‘(𝐺‘𝑋)) ∈ 𝐵)
16		mgcmnt2.2	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
17	3, 4, 5, 6, 7, 8, 1, 2, 13	mgccole2 32964	. . 3 ⊢ (𝜑 → (𝐹‘(𝐺‘𝑋)) ≲ 𝑋)
18		mgcmnt2.3	. . 3 ⊢ (𝜑 → 𝑋 ≲ 𝑌)
19	4, 6	prstr 18370	. . 3 ⊢ ((𝑊 ∈ Proset ∧ ((𝐹‘(𝐺‘𝑋)) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ((𝐹‘(𝐺‘𝑋)) ≲ 𝑋 ∧ 𝑋 ≲ 𝑌)) → (𝐹‘(𝐺‘𝑋)) ≲ 𝑌)
20	1, 15, 13, 16, 17, 18, 19	syl132anc 1388	. 2 ⊢ (𝜑 → (𝐹‘(𝐺‘𝑋)) ≲ 𝑌)
21		breq2 5170	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝐹‘(𝐺‘𝑋)) ≲ 𝑦 ↔ (𝐹‘(𝐺‘𝑋)) ≲ 𝑌))
22		fveq2 6920	. . . . 5 ⊢ (𝑦 = 𝑌 → (𝐺‘𝑦) = (𝐺‘𝑌))
23	22	breq2d 5178	. . . 4 ⊢ (𝑦 = 𝑌 → ((𝐺‘𝑋) ≤ (𝐺‘𝑦) ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑌)))
24	21, 23	bibi12d 345	. . 3 ⊢ (𝑦 = 𝑌 → (((𝐹‘(𝐺‘𝑋)) ≲ 𝑦 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑦)) ↔ ((𝐹‘(𝐺‘𝑋)) ≲ 𝑌 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑌))))
25		fveq2 6920	. . . . . . 7 ⊢ (𝑥 = (𝐺‘𝑋) → (𝐹‘𝑥) = (𝐹‘(𝐺‘𝑋)))
26	25	breq1d 5176	. . . . . 6 ⊢ (𝑥 = (𝐺‘𝑋) → ((𝐹‘𝑥) ≲ 𝑦 ↔ (𝐹‘(𝐺‘𝑋)) ≲ 𝑦))
27		breq1 5169	. . . . . 6 ⊢ (𝑥 = (𝐺‘𝑋) → (𝑥 ≤ (𝐺‘𝑦) ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑦)))
28	26, 27	bibi12d 345	. . . . 5 ⊢ (𝑥 = (𝐺‘𝑋) → (((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ((𝐹‘(𝐺‘𝑋)) ≲ 𝑦 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑦))))
29	28	ralbidv 3184	. . . 4 ⊢ (𝑥 = (𝐺‘𝑋) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑋)) ≲ 𝑦 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑦))))
30	10	simprd 495	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))
31	29, 30, 14	rspcdva 3636	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑋)) ≲ 𝑦 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑦)))
32	24, 31, 16	rspcdva 3636	. 2 ⊢ (𝜑 → ((𝐹‘(𝐺‘𝑋)) ≲ 𝑌 ↔ (𝐺‘𝑋) ≤ (𝐺‘𝑌)))
33	20, 32	mpbid 232	1 ⊢ (𝜑 → (𝐺‘𝑋) ≤ (𝐺‘𝑌))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∀wral 3067   class class class wbr 5166  ⟶wf 6569  ‘cfv 6573  (class class class)co 7448  Basecbs 17258  lecple 17318   Proset cproset 18363  MGalConncmgc 32952

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-map 8886  df-proset 18365  df-mgc 32954

This theorem is referenced by:  dfmgc2  32969  mgcf1olem2  32975