![]() |
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 31643 | . . . 4 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑉Monot𝑊) = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))}) |
6 | 5 | eleq2d 2824 | . . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐹 ∈ (𝑉Monot𝑊) ↔ 𝐹 ∈ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})) |
7 | fveq1 6837 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
8 | fveq1 6837 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦)) | |
9 | 7, 8 | breq12d 5117 | . . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) ≲ (𝑓‘𝑦) ↔ (𝐹‘𝑥) ≲ (𝐹‘𝑦))) |
10 | 9 | imbi2d 341 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦)) ↔ (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
11 | 10 | 2ralbidv 3211 | . . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
12 | 11 | elrab 3644 | . . 3 ⊢ (𝐹 ∈ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))} ↔ (𝐹 ∈ (𝐵 ↑m 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
13 | 6, 12 | bitrdi 287 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐹 ∈ (𝑉Monot𝑊) ↔ (𝐹 ∈ (𝐵 ↑m 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦))))) |
14 | 2 | fvexi 6852 | . . . 4 ⊢ 𝐵 ∈ V |
15 | 1 | fvexi 6852 | . . . 4 ⊢ 𝐴 ∈ V |
16 | 14, 15 | elmap 8743 | . . 3 ⊢ (𝐹 ∈ (𝐵 ↑m 𝐴) ↔ 𝐹:𝐴⟶𝐵) |
17 | 16 | anbi1i 625 | . 2 ⊢ ((𝐹 ∈ (𝐵 ↑m 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦))) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
18 | 13, 17 | bitrdi 287 | 1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐹 ∈ (𝑉Monot𝑊) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3063 {crab 3406 class class class wbr 5104 ⟶wf 6488 ‘cfv 6492 (class class class)co 7350 ↑m cmap 8699 Basecbs 17019 lecple 17076 Monotcmnt 31639 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2709 ax-sep 5255 ax-nul 5262 ax-pow 5319 ax-pr 5383 ax-un 7663 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2888 df-ne 2943 df-ral 3064 df-rex 3073 df-rab 3407 df-v 3446 df-sbc 3739 df-csb 3855 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4865 df-br 5105 df-opab 5167 df-id 5529 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-iota 6444 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-ov 7353 df-oprab 7354 df-mpo 7355 df-map 8701 df-mnt 31641 |
This theorem is referenced by: ismntd 31645 mntf 31646 mgcmnt1d 31658 mgcmnt2d 31659 |
Copyright terms: Public domain | W3C validator |