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

Theorem mntoval 33642
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.
StepHypRef Expression
1 df-mnt 33640 . . 3 Monot = (𝑣 ∈ V, 𝑤 ∈ V ↦ ⦋(Base‘𝑣) / 𝑎⦌{𝑓 ∈ ((Base‘𝑤) ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦))})
21a1i 11 . 2 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → Monot = (𝑣 ∈ V, 𝑤 ∈ V ↦ ⦋(Base‘𝑣) / 𝑎⦌{𝑓 ∈ ((Base‘𝑤) ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦))}))
3 fvexd 6931 . . . 4 ((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) → (Base‘𝑣) ∈ V)
4 fveq2 6916 . . . . . 6 (𝑣 = 𝑉 → (Base‘𝑣) = (Base‘𝑉))
5 mntoval.1 . . . . . 6 𝐴 = (Base‘𝑉)
64, 5eqtr4di 2816 . . . . 5 (𝑣 = 𝑉 → (Base‘𝑣) = 𝐴)
76adantr 486 . . . 4 ((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) → (Base‘𝑣) = 𝐴)
8 simplr 781 . . . . . . . 8 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → 𝑤 = 𝑊)
98fveq2d 6920 . . . . . . 7 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (Base‘𝑤) = (Base‘𝑊))
10 mntoval.2 . . . . . . 7 𝐵 = (Base‘𝑊)
119, 10eqtr4di 2816 . . . . . 6 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (Base‘𝑤) = 𝐵)
12 simpr 490 . . . . . 6 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → 𝑎 = 𝐴)
1311, 12oveq12d 7469 . . . . 5 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → ((Base‘𝑤) ↑m 𝑎) = (𝐵 ↑m 𝐴))
14 simpll 779 . . . . . . . . . . 11 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → 𝑣 = 𝑉)
1514fveq2d 6920 . . . . . . . . . 10 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (le‘𝑣) = (le‘𝑉))
16 mntoval.3 . . . . . . . . . 10 ≤ = (le‘𝑉)
1715, 16eqtr4di 2816 . . . . . . . . 9 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (le‘𝑣) = ≤ )
1817breqd 5119 . . . . . . . 8 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (𝑥(le‘𝑣)𝑦 ↔ 𝑥 ≤ 𝑦))
198fveq2d 6920 . . . . . . . . . 10 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (le‘𝑤) = (le‘𝑊))
20 mntoval.4 . . . . . . . . . 10 ≲ = (le‘𝑊)
2119, 20eqtr4di 2816 . . . . . . . . 9 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (le‘𝑤) = ≲ )
2221breqd 5119 . . . . . . . 8 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → ((𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦) ↔ (𝑓‘𝑥) ≲ (𝑓‘𝑦)))
2318, 22imbi12d 347 . . . . . . 7 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → ((𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦)) ↔ (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))))
2412, 23raleqbidv 3338 . . . . . 6 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦)) ↔ ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))))
2512, 24raleqbidv 3338 . . . . 5 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → (∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))))
2613, 25rabeqbidv 3433 . . . 4 (((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) ∧ 𝑎 = 𝐴) → {𝑓 ∈ ((Base‘𝑤) ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦))} = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})
273, 7, 26csbied2 3888 . . 3 ((𝑣 = 𝑉 ∧ 𝑤 = 𝑊) → ⦋(Base‘𝑣) / 𝑎⦌{𝑓 ∈ ((Base‘𝑤) ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦))} = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})
2827adantl 487 . 2 (((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) ∧ (𝑣 = 𝑉 ∧ 𝑤 = 𝑊)) → ⦋(Base‘𝑣) / 𝑎⦌{𝑓 ∈ ((Base‘𝑤) ↑m 𝑎) ∣ ∀𝑥 ∈ 𝑎 ∀𝑦 ∈ 𝑎 (𝑥(le‘𝑣)𝑦 → (𝑓‘𝑥)(le‘𝑤)(𝑓‘𝑦))} = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})
29 elex 3475 . . 3 (𝑉 ∈ 𝑋 → 𝑉 ∈ V)
3029adantr 486 . 2 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → 𝑉 ∈ V)
31 elex 3475 . . 3 (𝑊 ∈ 𝑌 → 𝑊 ∈ V)
3231adantl 487 . 2 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → 𝑊 ∈ V)
33 eqid 2763 . . 3 {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))} = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))}
34 ovexd 7486 . . 3 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐵 ↑m 𝐴) ∈ V)
3533, 34rabexd 5308 . 2 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))} ∈ V)
362, 28, 30, 32, 35ovmpod 7604 1 ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑉Monot𝑊) = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454  ⦋csb 3851   class class class wbr 5108  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453   ↑m cmap 8885  Basecbs 17431  lecple 17479  Monotcmnt 33638
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-mnt 33640
This theorem is used by:  ismnt  33643
  Copyright terms: Public domain W3C validator