Theorem mgccole2 33375

Description: Inequality for the closure operator (𝐹 ∘ 𝐺) of the Galois connection 𝐻. (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	⊢ (𝜑 → 𝐹𝐻𝐺)
mgccole2.1	⊢ (𝜑 → 𝑌 ∈ 𝐵)

Assertion

Ref	Expression
mgccole2	⊢ (𝜑 → (𝐹‘(𝐺‘𝑌)) ≲ 𝑌)

Proof of Theorem mgccole2

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

Step	Hyp	Ref	Expression
1		mgcval.2	. . 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.3	. . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ Proset )
9	3, 4, 5, 6, 7, 1, 8	mgcval 33371	. . . . . 6 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))))
10	2, 9	mpbid 235	. . . . 5 ⊢ (𝜑 → ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦))))
11	10	simplrd 782	. . . 4 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
12		mgccole2.1	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
13	11, 12	ffvelcdmd 7084	. . 3 ⊢ (𝜑 → (𝐺‘𝑌) ∈ 𝐴)
14	3, 5	prsref 18376	. . 3 ⊢ ((𝑉 ∈ Proset ∧ (𝐺‘𝑌) ∈ 𝐴) → (𝐺‘𝑌) ≤ (𝐺‘𝑌))
15	1, 13, 14	syl2anc 596	. 2 ⊢ (𝜑 → (𝐺‘𝑌) ≤ (𝐺‘𝑌))
16	10	simprd 501	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))
17		fveq2 6885	. . . . . . . . 9 ⊢ (𝑥 = (𝐺‘𝑌) → (𝐹‘𝑥) = (𝐹‘(𝐺‘𝑌)))
18	17	breq1d 5121	. . . . . . . 8 ⊢ (𝑥 = (𝐺‘𝑌) → ((𝐹‘𝑥) ≲ 𝑦 ↔ (𝐹‘(𝐺‘𝑌)) ≲ 𝑦))
19		breq1 5114	. . . . . . . 8 ⊢ (𝑥 = (𝐺‘𝑌) → (𝑥 ≤ (𝐺‘𝑦) ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦)))
20	18, 19	bibi12d 348	. . . . . . 7 ⊢ (𝑥 = (𝐺‘𝑌) → (((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦))))
21	20	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = (𝐺‘𝑌)) → (((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦))))
22	21	ralbidv 3190	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = (𝐺‘𝑌)) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦))))
23	13, 22	rspcdv 3575	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) → ∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦))))
24	16, 23	mpd 16	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦)))
25		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌)
26	25	breq2d 5123	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐹‘(𝐺‘𝑌)) ≲ 𝑌))
27		fveq2 6885	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝐺‘𝑦) = (𝐺‘𝑌))
28	27	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → (𝐺‘𝑦) = (𝐺‘𝑌))
29	28	breq2d 5123	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → ((𝐺‘𝑌) ≤ (𝐺‘𝑦) ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑌)))
30	26, 29	bibi12d 348	. . . 4 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → (((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦)) ↔ ((𝐹‘(𝐺‘𝑌)) ≲ 𝑌 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑌))))
31	12, 30	rspcdv 3575	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦)) → ((𝐹‘(𝐺‘𝑌)) ≲ 𝑌 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑌))))
32	24, 31	mpd 16	. 2 ⊢ (𝜑 → ((𝐹‘(𝐺‘𝑌)) ≲ 𝑌 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑌)))
33	15, 32	mpbird 260	1 ⊢ (𝜑 → (𝐹‘(𝐺‘𝑌)) ≲ 𝑌)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081   class class class wbr 5111  ⟶wf 6536  ‘cfv 6540  (class class class)co 7419  Basecbs 17291  lecple 17339   Proset cproset 18370  MGalConncmgc 33363

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-map 8832  df-proset 18372  df-mgc 33365

This theorem is used by:  mgcmnt2  33377  mgcmntco  33378  dfmgc2  33380  mgcf1olem1  33385  mgcf1olem2  33386