Theorem mgcf1 32973

Description: The lower 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
mgcf1	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)

Proof of Theorem mgcf1

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 32972	. . 3 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))))
10	1, 9	mpbid 232	. 2 ⊢ (𝜑 → ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦))))
11	10	simplld 767	1 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3052   class class class wbr 5124  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410  Basecbs 17233  lecple 17283   Proset cproset 18309  MGalConncmgc 32964

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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-br 5125  df-opab 5187  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8847  df-mgc 32966

This theorem is referenced by:  mgcmntco  32979  mgcmnt1d  32982