Theorem mgcf2 32979

Description: The upper adjoint 𝐺 of a Galois connection is a function. (Contributed by Thierry Arnoux, 24-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	⊢ (𝜑 → 𝐹𝐻𝐺)

Assertion

Ref	Expression
mgcf2	⊢ (𝜑 → 𝐺:𝐵⟶𝐴)

Proof of Theorem mgcf2

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

Step	Hyp	Ref	Expression
1		mgccole.1	. . 3 ⊢ (𝜑 → 𝐹𝐻𝐺)
2		mgcoval.1	. . . 4 ⊢ 𝐴 = (Base‘𝑉)
3		mgcoval.2	. . . 4 ⊢ 𝐵 = (Base‘𝑊)
4		mgcoval.3	. . . 4 ⊢ ≤ = (le‘𝑉)
5		mgcoval.4	. . . 4 ⊢ ≲ = (le‘𝑊)
6		mgcval.1	. . . 4 ⊢ 𝐻 = (𝑉MGalConn𝑊)
7		mgcval.2	. . . 4 ⊢ (𝜑 → 𝑉 ∈ Proset )
8		mgcval.3	. . . 4 ⊢ (𝜑 → 𝑊 ∈ Proset )
9	2, 3, 4, 5, 6, 7, 8	mgcval 32977	. . 3 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))))
10	1, 9	mpbid 232	. 2 ⊢ (𝜑 → ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦))))
11	10	simplrd 770	1 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ∀wral 3061   class class class wbr 5143  ⟶wf 6557  ‘cfv 6561  (class class class)co 7431  Basecbs 17247  lecple 17304   Proset cproset 18338  MGalConncmgc 32969

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-map 8868  df-mgc 32971

This theorem is referenced by:  mgcmntco  32984  mgcmnt2d  32988