dfmgc2 - Mathbox for Thierry Arnoux

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

Theorem dfmgc2 33175

Description: Alternate definition of the monotone 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 )

**Assertion**
Ref	Expression
dfmgc2	⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣))) ∧ (∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥)))))))

Distinct variable groups: 𝑣, ≤ 𝑣, ≲ 𝑣,𝐴,𝑥,𝑦 𝑣,𝐵,𝑥,𝑦 𝑣,𝑉,𝑥,𝑦 𝑣,𝑊,𝑥,𝑦 𝑥,𝐹,𝑦 𝑥,𝐺,𝑦 𝑢, ≤ 𝜑,𝑥,𝑦 𝑥,𝐻,𝑦 𝜑,𝑢,𝑣 𝑢,𝐻,𝑣 𝑢,𝐺,𝑣 𝑢,𝐹,𝑣 𝑢,𝐵 𝑢, ≲ 𝑥, ≤ ,𝑦 𝑥, ≲ ,𝑦 Allowed substitution hints: 𝐴(𝑢) 𝑉(𝑢) 𝑊(𝑢)

Proof of Theorem dfmgc2 Dummy variables 𝑖 𝑗 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mgcoval.1	. . . . 5 ⊢ 𝐴 = (Base‘𝑉)
2		mgcoval.2	. . . . 5 ⊢ 𝐵 = (Base‘𝑊)
3		mgcoval.3	. . . . 5 ⊢ ≤ = (le‘𝑉)
4		mgcoval.4	. . . . 5 ⊢ ≲ = (le‘𝑊)
5		mgcval.1	. . . . 5 ⊢ 𝐻 = (𝑉MGalConn𝑊)
6		mgcval.2	. . . . 5 ⊢ (𝜑 → 𝑉 ∈ Proset )
7		mgcval.3	. . . . 5 ⊢ (𝜑 → 𝑊 ∈ Proset )
8	1, 2, 3, 4, 5, 6, 7	mgcval 33166	. . . 4 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝐹‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝐺‘𝑦)))))
9	8	simprbda 502	. . 3 ⊢ ((𝜑 ∧ 𝐹𝐻𝐺) → (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴))
10	6	ad4antr 742	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ≤ 𝑦) → 𝑉 ∈ Proset )
11	7	ad4antr 742	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ≤ 𝑦) → 𝑊 ∈ Proset )
12		simp-4r 793	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ≤ 𝑦) → 𝐹𝐻𝐺)
13		simpllr 785	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ≤ 𝑦) → 𝑥 ∈ 𝐴)
14		simplr 778	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ≤ 𝑦) → 𝑦 ∈ 𝐴)
15		simpr 488	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ≤ 𝑦) → 𝑥 ≤ 𝑦)
16	1, 2, 3, 4, 5, 10, 11, 12, 13, 14, 15	mgcmnt1 33171	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) ∧ 𝑥 ≤ 𝑦) → (𝐹‘𝑥) ≲ (𝐹‘𝑦))
17	16	ex 416	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))
18	17	anasss 470	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))
19	18	ralrimivva 3206	. . . . 5 ⊢ ((𝜑 ∧ 𝐹𝐻𝐺) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))
20	6	ad4antr 742	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) ∧ 𝑣 ∈ 𝐵) ∧ 𝑢 ≲ 𝑣) → 𝑉 ∈ Proset )
21	7	ad4antr 742	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) ∧ 𝑣 ∈ 𝐵) ∧ 𝑢 ≲ 𝑣) → 𝑊 ∈ Proset )
22		simp-4r 793	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) ∧ 𝑣 ∈ 𝐵) ∧ 𝑢 ≲ 𝑣) → 𝐹𝐻𝐺)
23		simpllr 785	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) ∧ 𝑣 ∈ 𝐵) ∧ 𝑢 ≲ 𝑣) → 𝑢 ∈ 𝐵)
24		simplr 778	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) ∧ 𝑣 ∈ 𝐵) ∧ 𝑢 ≲ 𝑣) → 𝑣 ∈ 𝐵)
25		simpr 488	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) ∧ 𝑣 ∈ 𝐵) ∧ 𝑢 ≲ 𝑣) → 𝑢 ≲ 𝑣)
26	1, 2, 3, 4, 5, 20, 21, 22, 23, 24, 25	mgcmnt2 33172	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) ∧ 𝑣 ∈ 𝐵) ∧ 𝑢 ≲ 𝑣) → (𝐺‘𝑢) ≤ (𝐺‘𝑣))
27	26	ex 416	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) ∧ 𝑣 ∈ 𝐵) → (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))
28	27	anasss 470	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ (𝑢 ∈ 𝐵 ∧ 𝑣 ∈ 𝐵)) → (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))
29	28	ralrimivva 3206	. . . . 5 ⊢ ((𝜑 ∧ 𝐹𝐻𝐺) → ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))
30	19, 29	jca 519	. . . 4 ⊢ ((𝜑 ∧ 𝐹𝐻𝐺) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣))))
31	6	ad2antrr 736	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) → 𝑉 ∈ Proset )
32	7	ad2antrr 736	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) → 𝑊 ∈ Proset )
33		simplr 778	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) → 𝐹𝐻𝐺)
34		simpr 488	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) → 𝑢 ∈ 𝐵)
35	1, 2, 3, 4, 5, 31, 32, 33, 34	mgccole2 33170	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑢 ∈ 𝐵) → (𝐹‘(𝐺‘𝑢)) ≲ 𝑢)
36	35	ralrimiva 3155	. . . . 5 ⊢ ((𝜑 ∧ 𝐹𝐻𝐺) → ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢)
37	6	ad2antrr 736	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) → 𝑉 ∈ Proset )
38	7	ad2antrr 736	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) → 𝑊 ∈ Proset )
39		simplr 778	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) → 𝐹𝐻𝐺)
40		simpr 488	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
41	1, 2, 3, 4, 5, 37, 38, 39, 40	mgccole1 33169	. . . . . 6 ⊢ (((𝜑 ∧ 𝐹𝐻𝐺) ∧ 𝑥 ∈ 𝐴) → 𝑥 ≤ (𝐺‘(𝐹‘𝑥)))
42	41	ralrimiva 3155	. . . . 5 ⊢ ((𝜑 ∧ 𝐹𝐻𝐺) → ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥)))
43	36, 42	jca 519	. . . 4 ⊢ ((𝜑 ∧ 𝐹𝐻𝐺) → (∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))))
44	30, 43	jca 519	. . 3 ⊢ ((𝜑 ∧ 𝐹𝐻𝐺) → ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣))) ∧ (∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥)))))
45	9, 44	jca 519	. 2 ⊢ ((𝜑 ∧ 𝐹𝐻𝐺) → ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣))) ∧ (∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))))))
46	6	ad4antr 742	. . . . . 6 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → 𝑉 ∈ Proset )
47	7	ad4antr 742	. . . . . 6 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → 𝑊 ∈ Proset )
48		simp-4r 793	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴))
49	48	simpld 498	. . . . . 6 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → 𝐹:𝐴⟶𝐵)
50	48	simprd 499	. . . . . 6 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → 𝐺:𝐵⟶𝐴)
51		simpllr 785	. . . . . . . 8 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣))))
52	51	simpld 498	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))
53		breq1 5104	. . . . . . . . 9 ⊢ (𝑥 = 𝑚 → (𝑥 ≤ 𝑦 ↔ 𝑚 ≤ 𝑦))
54		fveq2 6868	. . . . . . . . . 10 ⊢ (𝑥 = 𝑚 → (𝐹‘𝑥) = (𝐹‘𝑚))
55	54	breq1d 5111	. . . . . . . . 9 ⊢ (𝑥 = 𝑚 → ((𝐹‘𝑥) ≲ (𝐹‘𝑦) ↔ (𝐹‘𝑚) ≲ (𝐹‘𝑦)))
56	53, 55	imbi12d 346	. . . . . . . 8 ⊢ (𝑥 = 𝑚 → ((𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ↔ (𝑚 ≤ 𝑦 → (𝐹‘𝑚) ≲ (𝐹‘𝑦))))
57		breq2 5105	. . . . . . . . 9 ⊢ (𝑦 = 𝑛 → (𝑚 ≤ 𝑦 ↔ 𝑚 ≤ 𝑛))
58		fveq2 6868	. . . . . . . . . 10 ⊢ (𝑦 = 𝑛 → (𝐹‘𝑦) = (𝐹‘𝑛))
59	58	breq2d 5113	. . . . . . . . 9 ⊢ (𝑦 = 𝑛 → ((𝐹‘𝑚) ≲ (𝐹‘𝑦) ↔ (𝐹‘𝑚) ≲ (𝐹‘𝑛)))
60	57, 59	imbi12d 346	. . . . . . . 8 ⊢ (𝑦 = 𝑛 → ((𝑚 ≤ 𝑦 → (𝐹‘𝑚) ≲ (𝐹‘𝑦)) ↔ (𝑚 ≤ 𝑛 → (𝐹‘𝑚) ≲ (𝐹‘𝑛))))
61	56, 60	cbvral2vw 3245	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ↔ ∀𝑚 ∈ 𝐴 ∀𝑛 ∈ 𝐴 (𝑚 ≤ 𝑛 → (𝐹‘𝑚) ≲ (𝐹‘𝑛)))
62	52, 61	sylib 220	. . . . . 6 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → ∀𝑚 ∈ 𝐴 ∀𝑛 ∈ 𝐴 (𝑚 ≤ 𝑛 → (𝐹‘𝑚) ≲ (𝐹‘𝑛)))
63	51	simprd 499	. . . . . . 7 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))
64		breq1 5104	. . . . . . . . 9 ⊢ (𝑢 = 𝑖 → (𝑢 ≲ 𝑣 ↔ 𝑖 ≲ 𝑣))
65		fveq2 6868	. . . . . . . . . 10 ⊢ (𝑢 = 𝑖 → (𝐺‘𝑢) = (𝐺‘𝑖))
66	65	breq1d 5111	. . . . . . . . 9 ⊢ (𝑢 = 𝑖 → ((𝐺‘𝑢) ≤ (𝐺‘𝑣) ↔ (𝐺‘𝑖) ≤ (𝐺‘𝑣)))
67	64, 66	imbi12d 346	. . . . . . . 8 ⊢ (𝑢 = 𝑖 → ((𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)) ↔ (𝑖 ≲ 𝑣 → (𝐺‘𝑖) ≤ (𝐺‘𝑣))))
68		breq2 5105	. . . . . . . . 9 ⊢ (𝑣 = 𝑗 → (𝑖 ≲ 𝑣 ↔ 𝑖 ≲ 𝑗))
69		fveq2 6868	. . . . . . . . . 10 ⊢ (𝑣 = 𝑗 → (𝐺‘𝑣) = (𝐺‘𝑗))
70	69	breq2d 5113	. . . . . . . . 9 ⊢ (𝑣 = 𝑗 → ((𝐺‘𝑖) ≤ (𝐺‘𝑣) ↔ (𝐺‘𝑖) ≤ (𝐺‘𝑗)))
71	68, 70	imbi12d 346	. . . . . . . 8 ⊢ (𝑣 = 𝑗 → ((𝑖 ≲ 𝑣 → (𝐺‘𝑖) ≤ (𝐺‘𝑣)) ↔ (𝑖 ≲ 𝑗 → (𝐺‘𝑖) ≤ (𝐺‘𝑗))))
72	67, 71	cbvral2vw 3245	. . . . . . 7 ⊢ (∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)) ↔ ∀𝑖 ∈ 𝐵 ∀𝑗 ∈ 𝐵 (𝑖 ≲ 𝑗 → (𝐺‘𝑖) ≤ (𝐺‘𝑗)))
73	63, 72	sylib 220	. . . . . 6 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → ∀𝑖 ∈ 𝐵 ∀𝑗 ∈ 𝐵 (𝑖 ≲ 𝑗 → (𝐺‘𝑖) ≤ (𝐺‘𝑗)))
74		id 22	. . . . . . . 8 ⊢ (𝑥 = 𝑚 → 𝑥 = 𝑚)
75		2fveq3 6873	. . . . . . . 8 ⊢ (𝑥 = 𝑚 → (𝐺‘(𝐹‘𝑥)) = (𝐺‘(𝐹‘𝑚)))
76	74, 75	breq12d 5114	. . . . . . 7 ⊢ (𝑥 = 𝑚 → (𝑥 ≤ (𝐺‘(𝐹‘𝑥)) ↔ 𝑚 ≤ (𝐺‘(𝐹‘𝑚))))
77		simplr 778	. . . . . . 7 ⊢ ((((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) ∧ 𝑚 ∈ 𝐴) → ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥)))
78		simpr 488	. . . . . . 7 ⊢ ((((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) ∧ 𝑚 ∈ 𝐴) → 𝑚 ∈ 𝐴)
79	76, 77, 78	rspcdva 3583	. . . . . 6 ⊢ ((((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) ∧ 𝑚 ∈ 𝐴) → 𝑚 ≤ (𝐺‘(𝐹‘𝑚)))
80		2fveq3 6873	. . . . . . . 8 ⊢ (𝑢 = 𝑖 → (𝐹‘(𝐺‘𝑢)) = (𝐹‘(𝐺‘𝑖)))
81		id 22	. . . . . . . 8 ⊢ (𝑢 = 𝑖 → 𝑢 = 𝑖)
82	80, 81	breq12d 5114	. . . . . . 7 ⊢ (𝑢 = 𝑖 → ((𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ↔ (𝐹‘(𝐺‘𝑖)) ≲ 𝑖))
83		simpllr 785	. . . . . . 7 ⊢ ((((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) ∧ 𝑖 ∈ 𝐵) → ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢)
84		simpr 488	. . . . . . 7 ⊢ ((((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) ∧ 𝑖 ∈ 𝐵) → 𝑖 ∈ 𝐵)
85	82, 83, 84	rspcdva 3583	. . . . . 6 ⊢ ((((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) ∧ 𝑖 ∈ 𝐵) → (𝐹‘(𝐺‘𝑖)) ≲ 𝑖)
86	1, 2, 3, 4, 5, 46, 47, 49, 50, 62, 73, 79, 85	dfmgc2lem 33174	. . . . 5 ⊢ (((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ ∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢) ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))) → 𝐹𝐻𝐺)
87	86	anasss 470	. . . 4 ⊢ ((((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣)))) ∧ (∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥)))) → 𝐹𝐻𝐺)
88	87	anasss 470	. . 3 ⊢ (((𝜑 ∧ (𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴)) ∧ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣))) ∧ (∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥))))) → 𝐹𝐻𝐺)
89	88	anasss 470	. 2 ⊢ ((𝜑 ∧ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣))) ∧ (∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥)))))) → 𝐹𝐻𝐺)
90	45, 89	impbida 810	1 ⊢ (𝜑 → (𝐹𝐻𝐺 ↔ ((𝐹:𝐴⟶𝐵 ∧ 𝐺:𝐵⟶𝐴) ∧ ((∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)) ∧ ∀𝑢 ∈ 𝐵 ∀𝑣 ∈ 𝐵 (𝑢 ≲ 𝑣 → (𝐺‘𝑢) ≤ (𝐺‘𝑣))) ∧ (∀𝑢 ∈ 𝐵 (𝐹‘(𝐺‘𝑢)) ≲ 𝑢 ∧ ∀𝑥 ∈ 𝐴 𝑥 ≤ (𝐺‘(𝐹‘𝑥)))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1561 ∈ wcel 2143 ∀wral 3077 class class class wbr 5101 ⟶wf 6518 ‘cfv 6522 (class class class)co 7397 Basecbs 17246 lecple 17294 Proset cproset 18325 MGalConncmgc 33158

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3078 df-rex 3088 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5102 df-opab 5164 df-id 5543 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-fv 6530 df-ov 7400 df-oprab 7401 df-mpo 7402 df-map 8811 df-proset 18327 df-mgc 33160

This theorem is referenced by: mgcmnt1d 33176 mgcmnt2d 33177 mgcf1olem1 33180 mgcf1olem2 33181 mgcf1o 33182

W3C validator