Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > ismnt | Structured version Visualization version GIF version |
Description: Express the statement "𝐹 is monotone". (Contributed by Thierry Arnoux, 23-Apr-2024.) |
Ref | Expression |
---|---|
mntoval.1 | ⊢ 𝐴 = (Base‘𝑉) |
mntoval.2 | ⊢ 𝐵 = (Base‘𝑊) |
mntoval.3 | ⊢ ≤ = (le‘𝑉) |
mntoval.4 | ⊢ ≲ = (le‘𝑊) |
Ref | Expression |
---|---|
ismnt | ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐹 ∈ (𝑉Monot𝑊) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mntoval.1 | . . . . 5 ⊢ 𝐴 = (Base‘𝑉) | |
2 | mntoval.2 | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
3 | mntoval.3 | . . . . 5 ⊢ ≤ = (le‘𝑉) | |
4 | mntoval.4 | . . . . 5 ⊢ ≲ = (le‘𝑊) | |
5 | 1, 2, 3, 4 | mntoval 30933 | . . . 4 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑉Monot𝑊) = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))}) |
6 | 5 | eleq2d 2816 | . . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐹 ∈ (𝑉Monot𝑊) ↔ 𝐹 ∈ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})) |
7 | fveq1 6694 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
8 | fveq1 6694 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦)) | |
9 | 7, 8 | breq12d 5052 | . . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) ≲ (𝑓‘𝑦) ↔ (𝐹‘𝑥) ≲ (𝐹‘𝑦))) |
10 | 9 | imbi2d 344 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦)) ↔ (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
11 | 10 | 2ralbidv 3110 | . . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
12 | 11 | elrab 3591 | . . 3 ⊢ (𝐹 ∈ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))} ↔ (𝐹 ∈ (𝐵 ↑m 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
13 | 6, 12 | bitrdi 290 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐹 ∈ (𝑉Monot𝑊) ↔ (𝐹 ∈ (𝐵 ↑m 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦))))) |
14 | 2 | fvexi 6709 | . . . 4 ⊢ 𝐵 ∈ V |
15 | 1 | fvexi 6709 | . . . 4 ⊢ 𝐴 ∈ V |
16 | 14, 15 | elmap 8530 | . . 3 ⊢ (𝐹 ∈ (𝐵 ↑m 𝐴) ↔ 𝐹:𝐴⟶𝐵) |
17 | 16 | anbi1i 627 | . 2 ⊢ ((𝐹 ∈ (𝐵 ↑m 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦))) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
18 | 13, 17 | bitrdi 290 | 1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐹 ∈ (𝑉Monot𝑊) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1543 ∈ wcel 2112 ∀wral 3051 {crab 3055 class class class wbr 5039 ⟶wf 6354 ‘cfv 6358 (class class class)co 7191 ↑m cmap 8486 Basecbs 16666 lecple 16756 Monotcmnt 30929 |
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 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pow 5243 ax-pr 5307 ax-un 7501 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ral 3056 df-rex 3057 df-rab 3060 df-v 3400 df-sbc 3684 df-csb 3799 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-pw 4501 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-br 5040 df-opab 5102 df-id 5440 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-iota 6316 df-fun 6360 df-fn 6361 df-f 6362 df-fv 6366 df-ov 7194 df-oprab 7195 df-mpo 7196 df-map 8488 df-mnt 30931 |
This theorem is referenced by: ismntd 30935 mntf 30936 mgcmnt1d 30948 mgcmnt2d 30949 |
Copyright terms: Public domain | W3C validator |