Theorem mgccole1 32923

Description: An inequality for the kernel operator 𝐺 ∘ 𝐹. (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	⊢ (𝜑 → 𝐹𝐻𝐺)
mgccole1.2	⊢ (𝜑 → 𝑋 ∈ 𝐴)

Assertion

Ref	Expression
mgccole1	⊢ (𝜑 → 𝑋 ≤ (𝐺‘(𝐹‘𝑋)))

Proof of Theorem mgccole1

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 32920	. . . . . 6 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))))
10	2, 9	mpbid 232	. . . . 5 ⊢ (𝜑 → ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦))))
11	10	simplld 767	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
12		mgccole1.2	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
13	11, 12	ffvelcdmd 7060	. . 3 ⊢ (𝜑 → (𝐹‘𝑋) ∈ 𝐵)
14	4, 6	prsref 18266	. . 3 ⊢ ((𝑊 ∈ Proset ∧ (𝐹‘𝑋) ∈ 𝐵) → (𝐹‘𝑋) ≲ (𝐹‘𝑋))
15	1, 13, 14	syl2anc 584	. 2 ⊢ (𝜑 → (𝐹‘𝑋) ≲ (𝐹‘𝑋))
16		fveq2 6861	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
17	16	breq1d 5120	. . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) ≲ 𝑦 ↔ (𝐹‘𝑋) ≲ 𝑦))
18		breq1 5113	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 ≤ (𝐺‘𝑦) ↔ 𝑋 ≤ (𝐺‘𝑦)))
19	17, 18	bibi12d 345	. . . . 5 ⊢ (𝑥 = 𝑋 → (((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ((𝐹‘𝑋) ≲ 𝑦 ↔ 𝑋 ≤ (𝐺‘𝑦))))
20	19	ralbidv 3157	. . . 4 ⊢ (𝑥 = 𝑋 → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑋) ≲ 𝑦 ↔ 𝑋 ≤ (𝐺‘𝑦))))
21	10	simprd 495	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))
22	20, 21, 12	rspcdva 3592	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ((𝐹‘𝑋) ≲ 𝑦 ↔ 𝑋 ≤ (𝐺‘𝑦)))
23		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑋)) → 𝑦 = (𝐹‘𝑋))
24	23	breq2d 5122	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑋)) → ((𝐹‘𝑋) ≲ 𝑦 ↔ (𝐹‘𝑋) ≲ (𝐹‘𝑋)))
25	23	fveq2d 6865	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑋)) → (𝐺‘𝑦) = (𝐺‘(𝐹‘𝑋)))
26	25	breq2d 5122	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑋)) → (𝑋 ≤ (𝐺‘𝑦) ↔ 𝑋 ≤ (𝐺‘(𝐹‘𝑋))))
27	24, 26	bibi12d 345	. . . 4 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑋)) → (((𝐹‘𝑋) ≲ 𝑦 ↔ 𝑋 ≤ (𝐺‘𝑦)) ↔ ((𝐹‘𝑋) ≲ (𝐹‘𝑋) ↔ 𝑋 ≤ (𝐺‘(𝐹‘𝑋)))))
28	13, 27	rspcdv 3583	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑋) ≲ 𝑦 ↔ 𝑋 ≤ (𝐺‘𝑦)) → ((𝐹‘𝑋) ≲ (𝐹‘𝑋) ↔ 𝑋 ≤ (𝐺‘(𝐹‘𝑋)))))
29	22, 28	mpd 15	. 2 ⊢ (𝜑 → ((𝐹‘𝑋) ≲ (𝐹‘𝑋) ↔ 𝑋 ≤ (𝐺‘(𝐹‘𝑋))))
30	15, 29	mpbid 232	1 ⊢ (𝜑 → 𝑋 ≤ (𝐺‘(𝐹‘𝑋)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3045   class class class wbr 5110  ⟶wf 6510  ‘cfv 6514  (class class class)co 7390  Basecbs 17186  lecple 17234   Proset cproset 18260  MGalConncmgc 32912

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 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

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 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-map 8804  df-proset 18262  df-mgc 32914

This theorem is referenced by:  mgcmnt1  32925  mgcmntco  32927  dfmgc2  32929  mgcf1olem1  32934  mgcf1olem2  32935