Theorem mntoval 30690

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

Hypotheses

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

Assertion

Ref	Expression
mntoval	⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑉Monot𝑊) = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})

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

Allowed substitution hints:   𝐵(𝑥,𝑦)   ≤ (𝑥,𝑦,𝑓)   𝑋(𝑥,𝑦,𝑓)   𝑌(𝑥,𝑦,𝑓)   ≲ (𝑥,𝑦,𝑓)

Proof of Theorem mntoval

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

Step	Hyp	Ref	Expression
1		df-mnt 30688	. . 3 ⊢ Monot = (𝑣 ∈ V, 𝑤 ∈ V ↦ ⦋(Base‘𝑣) / 𝑎⦌{𝑓 ∈ ((Base‘𝑤) ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦))})
2	1	a1i 11	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → Monot = (𝑣 ∈ V, 𝑤 ∈ V ↦ ⦋(Base‘𝑣) / 𝑎⦌{𝑓 ∈ ((Base‘𝑤) ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦))}))
3		fvexd 6660	. . . 4 ⊢ ((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) → (Base‘𝑣) ∈ V)
4		fveq2 6645	. . . . . 6 ⊢ (𝑣 = 𝑉 → (Base‘𝑣) = (Base‘𝑉))
5		mntoval.1	. . . . . 6 ⊢ 𝐴 = (Base‘𝑉)
6	4, 5	eqtr4di 2851	. . . . 5 ⊢ (𝑣 = 𝑉 → (Base‘𝑣) = 𝐴)
7	6	adantr 484	. . . 4 ⊢ ((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) → (Base‘𝑣) = 𝐴)
8		simplr 768	. . . . . . . 8 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → 𝑤 = 𝑊)
9	8	fveq2d 6649	. . . . . . 7 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (Base‘𝑤) = (Base‘𝑊))
10		mntoval.2	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑊)
11	9, 10	eqtr4di 2851	. . . . . 6 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (Base‘𝑤) = 𝐵)
12		simpr 488	. . . . . 6 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → 𝑎 = 𝐴)
13	11, 12	oveq12d 7153	. . . . 5 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → ((Base‘𝑤) ↑m 𝑎) = (𝐵 ↑m 𝐴))
14		simpll 766	. . . . . . . . . . 11 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → 𝑣 = 𝑉)
15	14	fveq2d 6649	. . . . . . . . . 10 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (le‘𝑣) = (le‘𝑉))
16		mntoval.3	. . . . . . . . . 10 ⊢ ≤ = (le‘𝑉)
17	15, 16	eqtr4di 2851	. . . . . . . . 9 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (le‘𝑣) = ≤ )
18	17	breqd 5041	. . . . . . . 8 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (𝑥(le‘𝑣)𝑦 ↔ 𝑥 ≤ 𝑦))
19	8	fveq2d 6649	. . . . . . . . . 10 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (le‘𝑤) = (le‘𝑊))
20		mntoval.4	. . . . . . . . . 10 ⊢ ≲ = (le‘𝑊)
21	19, 20	eqtr4di 2851	. . . . . . . . 9 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (le‘𝑤) = ≲ )
22	21	breqd 5041	. . . . . . . 8 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → ((𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦) ↔ (𝑓‘𝑥) ≲ (𝑓‘𝑦)))
23	18, 22	imbi12d 348	. . . . . . 7 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → ((𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦)) ↔ (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))))
24	12, 23	raleqbidv 3354	. . . . . 6 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦)) ↔ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))))
25	12, 24	raleqbidv 3354	. . . . 5 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))))
26	13, 25	rabeqbidv 3433	. . . 4 ⊢ (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → {𝑓 ∈ ((Base‘𝑤) ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦))} = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})
27	3, 7, 26	csbied2 3865	. . 3 ⊢ ((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) → ⦋(Base‘𝑣) / 𝑎⦌{𝑓 ∈ ((Base‘𝑤) ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦))} = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})
28	27	adantl 485	. 2 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) → ⦋(Base‘𝑣) / 𝑎⦌{𝑓 ∈ ((Base‘𝑤) ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦))} = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})
29		elex 3459	. . 3 ⊢ (𝑉 ∈ 𝑋 → 𝑉 ∈ V)
30	29	adantr 484	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → 𝑉 ∈ V)
31		elex 3459	. . 3 ⊢ (𝑊 ∈ 𝑌 → 𝑊 ∈ V)
32	31	adantl 485	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → 𝑊 ∈ V)
33		eqid 2798	. . 3 ⊢ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))} = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))}
34		ovexd 7170	. . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐵 ↑m 𝐴) ∈ V)
35	33, 34	rabexd 5200	. 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))} ∈ V)
36	2, 28, 30, 32, 35	ovmpod 7281	1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑉Monot𝑊) = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∀wral 3106  {crab 3110  Vcvv 3441  ⦋csb 3828   class class class wbr 5030  ‘cfv 6324  (class class class)co 7135   ∈ cmpo 7137   ↑_m cmap 8389  Basecbs 16475  lecple 16564  Monotcmnt 30686

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-iota 6283  df-fun 6326  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-mnt 30688

This theorem is referenced by:  ismnt  30691