Theorem mgccole1 32155

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 32152	. . . . . 6 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))))
10	2, 9	mpbid 231	. . . . 5 ⊢ (𝜑 → ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦))))
11	10	simplld 766	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
12		mgccole1.2	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
13	11, 12	ffvelcdmd 7087	. . 3 ⊢ (𝜑 → (𝐹‘𝑋) ∈ 𝐵)
14	4, 6	prsref 18251	. . 3 ⊢ ((𝑊 ∈ Proset ∧ (𝐹‘𝑋) ∈ 𝐵) → (𝐹‘𝑋) ≲ (𝐹‘𝑋))
15	1, 13, 14	syl2anc 584	. 2 ⊢ (𝜑 → (𝐹‘𝑋) ≲ (𝐹‘𝑋))
16		fveq2 6891	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
17	16	breq1d 5158	. . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥) ≲ 𝑦 ↔ (𝐹‘𝑋) ≲ 𝑦))
18		breq1 5151	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 ≤ (𝐺‘𝑦) ↔ 𝑋 ≤ (𝐺‘𝑦)))
19	17, 18	bibi12d 345	. . . . 5 ⊢ (𝑥 = 𝑋 → (((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ((𝐹‘𝑋) ≲ 𝑦 ↔ 𝑋 ≤ (𝐺‘𝑦))))
20	19	ralbidv 3177	. . . 4 ⊢ (𝑥 = 𝑋 → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘𝑋) ≲ 𝑦 ↔ 𝑋 ≤ (𝐺‘𝑦))))
21	10	simprd 496	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))
22	20, 21, 12	rspcdva 3613	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ((𝐹‘𝑋) ≲ 𝑦 ↔ 𝑋 ≤ (𝐺‘𝑦)))
23		simpr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑋)) → 𝑦 = (𝐹‘𝑋))
24	23	breq2d 5160	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑋)) → ((𝐹‘𝑋) ≲ 𝑦 ↔ (𝐹‘𝑋) ≲ (𝐹‘𝑋)))
25	23	fveq2d 6895	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑋)) → (𝐺‘𝑦) = (𝐺‘(𝐹‘𝑋)))
26	25	breq2d 5160	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑋)) → (𝑋 ≤ (𝐺‘𝑦) ↔ 𝑋 ≤ (𝐺‘(𝐹‘𝑋))))
27	24, 26	bibi12d 345	. . . 4 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑋)) → (((𝐹‘𝑋) ≲ 𝑦 ↔ 𝑋 ≤ (𝐺‘𝑦)) ↔ ((𝐹‘𝑋) ≲ (𝐹‘𝑋) ↔ 𝑋 ≤ (𝐺‘(𝐹‘𝑋)))))
28	13, 27	rspcdv 3604	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑋) ≲ 𝑦 ↔ 𝑋 ≤ (𝐺‘𝑦)) → ((𝐹‘𝑋) ≲ (𝐹‘𝑋) ↔ 𝑋 ≤ (𝐺‘(𝐹‘𝑋)))))
29	22, 28	mpd 15	. 2 ⊢ (𝜑 → ((𝐹‘𝑋) ≲ (𝐹‘𝑋) ↔ 𝑋 ≤ (𝐺‘(𝐹‘𝑋))))
30	15, 29	mpbid 231	1 ⊢ (𝜑 → 𝑋 ≤ (𝐺‘(𝐹‘𝑋)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3061   class class class wbr 5148  ⟶wf 6539  ‘cfv 6543  (class class class)co 7408  Basecbs 17143  lecple 17203   Proset cproset 18245  MGalConncmgc 32144

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7724

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551  df-ov 7411  df-oprab 7412  df-mpo 7413  df-map 8821  df-proset 18247  df-mgc 32146

This theorem is referenced by:  mgcmnt1  32157  mgcmntco  32159  dfmgc2  32161  mgcf1olem1  32166  mgcf1olem2  32167