mgccole2 - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > mgccole2		Structured version Visualization version GIF version

Theorem mgccole2 32666

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 32662	. . . . . 6 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))))
10	2, 9	mpbid 231	. . . . 5 ⊢ (𝜑 → ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦))))
11	10	simplrd 767	. . . 4 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
12		mgccole2.1	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
13	11, 12	ffvelcdmd 7081	. . 3 ⊢ (𝜑 → (𝐺‘𝑌) ∈ 𝐴)
14	3, 5	prsref 18264	. . 3 ⊢ ((𝑉 ∈ Proset ∧ (𝐺‘𝑌) ∈ 𝐴) → (𝐺‘𝑌) ≤ (𝐺‘𝑌))
15	1, 13, 14	syl2anc 583	. 2 ⊢ (𝜑 → (𝐺‘𝑌) ≤ (𝐺‘𝑌))
16	10	simprd 495	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))
17		fveq2 6885	. . . . . . . . 9 ⊢ (𝑥 = (𝐺‘𝑌) → (𝐹‘𝑥) = (𝐹‘(𝐺‘𝑌)))
18	17	breq1d 5151	. . . . . . . 8 ⊢ (𝑥 = (𝐺‘𝑌) → ((𝐹‘𝑥) ≲ 𝑦 ↔ (𝐹‘(𝐺‘𝑌)) ≲ 𝑦))
19		breq1 5144	. . . . . . . 8 ⊢ (𝑥 = (𝐺‘𝑌) → (𝑥 ≤ (𝐺‘𝑦) ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦)))
20	18, 19	bibi12d 345	. . . . . . 7 ⊢ (𝑥 = (𝐺‘𝑌) → (((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦))))
21	20	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = (𝐺‘𝑌)) → (((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦))))
22	21	ralbidv 3171	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = (𝐺‘𝑌)) → (∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦))))
23	13, 22	rspcdv 3598	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)) → ∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦))))
24	16, 23	mpd 15	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦)))
25		simpr 484	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌)
26	25	breq2d 5153	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐹‘(𝐺‘𝑌)) ≲ 𝑌))
27		fveq2 6885	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝐺‘𝑦) = (𝐺‘𝑌))
28	27	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → (𝐺‘𝑦) = (𝐺‘𝑌))
29	28	breq2d 5153	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → ((𝐺‘𝑌) ≤ (𝐺‘𝑦) ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑌)))
30	26, 29	bibi12d 345	. . . 4 ⊢ ((𝜑 ∧ 𝑦 = 𝑌) → (((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦)) ↔ ((𝐹‘(𝐺‘𝑌)) ≲ 𝑌 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑌))))
31	12, 30	rspcdv 3598	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ((𝐹‘(𝐺‘𝑌)) ≲ 𝑦 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑦)) → ((𝐹‘(𝐺‘𝑌)) ≲ 𝑌 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑌))))
32	24, 31	mpd 15	. 2 ⊢ (𝜑 → ((𝐹‘(𝐺‘𝑌)) ≲ 𝑌 ↔ (𝐺‘𝑌) ≤ (𝐺‘𝑌)))
33	15, 32	mpbird 257	1 ⊢ (𝜑 → (𝐹‘(𝐺‘𝑌)) ≲ 𝑌)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ∀wral 3055 class class class wbr 5141 ⟶wf 6533 ‘cfv 6537 (class class class)co 7405 Basecbs 17153 lecple 17213 Proset cproset 18258 MGalConncmgc 32654

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-ral 3056 df-rex 3065 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-br 5142 df-opab 5204 df-id 5567 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-ov 7408 df-oprab 7409 df-mpo 7410 df-map 8824 df-proset 18260 df-mgc 32656

This theorem is referenced by: mgcmnt2 32668 mgcmntco 32669 dfmgc2 32671 mgcf1olem1 32676 mgcf1olem2 32677

W3C validator