Theorem mgcoval 33069

Description: Operation value of the monotone Galois connection. (Contributed by Thierry Arnoux, 23-Apr-2024.)

Hypotheses

Ref	Expression
mgcoval.1	⊢ 𝐴 = (Base‘𝑉)
mgcoval.2	⊢ 𝐵 = (Base‘𝑊)
mgcoval.3	⊢ ≤ = (le‘𝑉)
mgcoval.4	⊢ ≲ = (le‘𝑊)

Assertion

Ref	Expression
mgcoval	⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑉MGalConn𝑊) = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝐵 ↑m 𝐴) ∧ 𝑔 ∈ (𝐴 ↑m 𝐵)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦)))})

Distinct variable groups:   𝐴,𝑓,𝑔,𝑥,𝑦   𝐵,𝑓,𝑔,𝑥,𝑦   𝑓,𝑉,𝑔,𝑥,𝑦   𝑓,𝑊,𝑔,𝑥,𝑦   𝑓,𝑋,𝑔,𝑥,𝑦   𝑓,𝑌,𝑔,𝑥,𝑦

Allowed substitution hints:   ≤ (𝑥,𝑦,𝑓,𝑔)   ≲ (𝑥,𝑦,𝑓,𝑔)

Proof of Theorem mgcoval

Dummy variables 𝑎 𝑏 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-mgc 33064	. . 3 ⊢ MGalConn = (𝑣 ∈ V, 𝑤 ∈ V ↦ ⦋(Base‘𝑣) / 𝑎⦌⦋(Base‘𝑤) / 𝑏⦌{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑏 ↑m 𝑎) ∧ 𝑔 ∈ (𝑎 ↑m 𝑏)) ∧ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑓‘𝑥)(le‘𝑤)𝑦 ↔ 𝑥(le‘𝑣)(𝑔‘𝑦)))})
2	1	a1i 11	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → MGalConn = (𝑣 ∈ V, 𝑤 ∈ V ↦ ⦋(Base‘𝑣) / 𝑎⦌⦋(Base‘𝑤) / 𝑏⦌{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑏 ↑m 𝑎) ∧ 𝑔 ∈ (𝑎 ↑m 𝑏)) ∧ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑓‘𝑥)(le‘𝑤)𝑦 ↔ 𝑥(le‘𝑣)(𝑔‘𝑦)))}))
3		fvexd 6846	. . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) → (Base‘𝑣) ∈ V)
4		simprl 777	. . . . 5 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) → 𝑣 = 𝑉)
5	4	fveq2d 6835	. . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) → (Base‘𝑣) = (Base‘𝑉))
6		mgcoval.1	. . . 4 ⊢ 𝐴 = (Base‘𝑉)
7	5, 6	eqtr4di 2794	. . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) → (Base‘𝑣) = 𝐴)
8		fvexd 6846	. . . 4 ⊢ ((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) → (Base‘𝑤) ∈ V)
9		simplrr 784	. . . . . 6 ⊢ ((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) → 𝑤 = 𝑊)
10	9	fveq2d 6835	. . . . 5 ⊢ ((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) → (Base‘𝑤) = (Base‘𝑊))
11		mgcoval.2	. . . . 5 ⊢ 𝐵 = (Base‘𝑊)
12	10, 11	eqtr4di 2794	. . . 4 ⊢ ((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) → (Base‘𝑤) = 𝐵)
13		simpr 486	. . . . . . . . 9 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → 𝑏 = 𝐵)
14		simplr 775	. . . . . . . . 9 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → 𝑎 = 𝐴)
15	13, 14	oveq12d 7378	. . . . . . . 8 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (𝑏 ↑m 𝑎) = (𝐵 ↑m 𝐴))
16	15	eleq2d 2827	. . . . . . 7 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (𝑓 ∈ (𝑏 ↑m 𝑎) ↔ 𝑓 ∈ (𝐵 ↑m 𝐴)))
17	14, 13	oveq12d 7378	. . . . . . . 8 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (𝑎 ↑m 𝑏) = (𝐴 ↑m 𝐵))
18	17	eleq2d 2827	. . . . . . 7 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (𝑔 ∈ (𝑎 ↑m 𝑏) ↔ 𝑔 ∈ (𝐴 ↑m 𝐵)))
19	16, 18	anbi12d 639	. . . . . 6 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → ((𝑓 ∈ (𝑏 ↑m 𝑎) ∧ 𝑔 ∈ (𝑎 ↑m 𝑏)) ↔ (𝑓 ∈ (𝐵 ↑m 𝐴) ∧ 𝑔 ∈ (𝐴 ↑m 𝐵))))
20	9	adantr 482	. . . . . . . . . . . 12 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → 𝑤 = 𝑊)
21	20	fveq2d 6835	. . . . . . . . . . 11 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (le‘𝑤) = (le‘𝑊))
22		mgcoval.4	. . . . . . . . . . 11 ⊢ ≲ = (le‘𝑊)
23	21, 22	eqtr4di 2794	. . . . . . . . . 10 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (le‘𝑤) = ≲ )
24	23	breqd 5086	. . . . . . . . 9 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → ((𝑓‘𝑥)(le‘𝑤)𝑦 ↔ (𝑓‘𝑥) ≲ 𝑦))
25	4	ad2antrr 733	. . . . . . . . . . . 12 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → 𝑣 = 𝑉)
26	25	fveq2d 6835	. . . . . . . . . . 11 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (le‘𝑣) = (le‘𝑉))
27		mgcoval.3	. . . . . . . . . . 11 ⊢ ≤ = (le‘𝑉)
28	26, 27	eqtr4di 2794	. . . . . . . . . 10 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (le‘𝑣) = ≤ )
29	28	breqd 5086	. . . . . . . . 9 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (𝑥(le‘𝑣)(𝑔‘𝑦) ↔ 𝑥 ≤ (𝑔‘𝑦)))
30	24, 29	bibi12d 347	. . . . . . . 8 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (((𝑓‘𝑥)(le‘𝑤)𝑦 ↔ 𝑥(le‘𝑣)(𝑔‘𝑦)) ↔ ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦))))
31	13, 30	raleqbidv 3315	. . . . . . 7 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (∀𝑦 ∈ 𝑏 ((𝑓‘𝑥)(le‘𝑤)𝑦 ↔ 𝑥(le‘𝑣)(𝑔‘𝑦)) ↔ ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦))))
32	14, 31	raleqbidv 3315	. . . . . 6 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑓‘𝑥)(le‘𝑤)𝑦 ↔ 𝑥(le‘𝑣)(𝑔‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦))))
33	19, 32	anbi12d 639	. . . . 5 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → (((𝑓 ∈ (𝑏 ↑m 𝑎) ∧ 𝑔 ∈ (𝑎 ↑m 𝑏)) ∧ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑓‘𝑥)(le‘𝑤)𝑦 ↔ 𝑥(le‘𝑣)(𝑔‘𝑦))) ↔ ((𝑓 ∈ (𝐵 ↑m 𝐴) ∧ 𝑔 ∈ (𝐴 ↑m 𝐵)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦)))))
34	33	opabbidv 5141	. . . 4 ⊢ (((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) ∧ 𝑏 = 𝐵) → {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑏 ↑m 𝑎) ∧ 𝑔 ∈ (𝑎 ↑m 𝑏)) ∧ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑓‘𝑥)(le‘𝑤)𝑦 ↔ 𝑥(le‘𝑣)(𝑔‘𝑦)))} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝐵 ↑m 𝐴) ∧ 𝑔 ∈ (𝐴 ↑m 𝐵)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦)))})
35	8, 12, 34	csbied2 3870	. . 3 ⊢ ((((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) ∧ 𝑎 = 𝐴) → ⦋(Base‘𝑤) / 𝑏⦌{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑏 ↑m 𝑎) ∧ 𝑔 ∈ (𝑎 ↑m 𝑏)) ∧ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑓‘𝑥)(le‘𝑤)𝑦 ↔ 𝑥(le‘𝑣)(𝑔‘𝑦)))} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝐵 ↑m 𝐴) ∧ 𝑔 ∈ (𝐴 ↑m 𝐵)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦)))})
36	3, 7, 35	csbied2 3870	. 2 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) → ⦋(Base‘𝑣) / 𝑎⦌⦋(Base‘𝑤) / 𝑏⦌{⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝑏 ↑m 𝑎) ∧ 𝑔 ∈ (𝑎 ↑m 𝑏)) ∧ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑏 ((𝑓‘𝑥)(le‘𝑤)𝑦 ↔ 𝑥(le‘𝑣)(𝑔‘𝑦)))} = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝐵 ↑m 𝐴) ∧ 𝑔 ∈ (𝐴 ↑m 𝐵)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦)))})
37		simpl 484	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → 𝑉 ∈ 𝑋)
38	37	elexd 3456	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → 𝑉 ∈ V)
39		simpr 486	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → 𝑊 ∈ 𝑌)
40	39	elexd 3456	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → 𝑊 ∈ V)
41		ovexd 7395	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐵 ↑m 𝐴) ∈ V)
42		ovexd 7395	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐴 ↑m 𝐵) ∈ V)
43		simprll 785	. . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ ((𝑓 ∈ (𝐵 ↑m 𝐴) ∧ 𝑔 ∈ (𝐴 ↑m 𝐵)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦)))) → 𝑓 ∈ (𝐵 ↑m 𝐴))
44		simprlr 786	. . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ ((𝑓 ∈ (𝐵 ↑m 𝐴) ∧ 𝑔 ∈ (𝐴 ↑m 𝐵)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦)))) → 𝑔 ∈ (𝐴 ↑m 𝐵))
45	41, 42, 43, 44	opabex2 8003	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝐵 ↑m 𝐴) ∧ 𝑔 ∈ (𝐴 ↑m 𝐵)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦)))} ∈ V)
46	2, 36, 38, 40, 45	ovmpod 7512	1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑉MGalConn𝑊) = {⟨𝑓, 𝑔⟩ ∣ ((𝑓 ∈ (𝐵 ↑m 𝐴) ∧ 𝑔 ∈ (𝐴 ↑m 𝐵)) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑓‘𝑥) ≲ 𝑦 ↔ 𝑥 ≤ (𝑔‘𝑦)))})

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 397   = wceq 1548   ∈ wcel 2121  ∀wral 3055  Vcvv 3433  ⦋csb 3833   class class class wbr 5075  {copab 5137  ‘cfv 6489  (class class class)co 7360   ∈ cmpo 7362   ↑_m cmap 8767  Basecbs 17174  lecple 17222  MGalConncmgc 33062

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7682

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-opab 5138  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-iota 6445  df-fun 6491  df-fv 6497  df-ov 7363  df-oprab 7364  df-mpo 7365  df-mgc 33064

This theorem is referenced by:  mgcval  33070