| 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 33064 | . . . 4 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝑉Monot𝑊) = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))}) |
| 6 | 5 | eleq2d 2822 | . . 3 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐹 ∈ (𝑉Monot𝑊) ↔ 𝐹 ∈ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))})) |
| 7 | fveq1 6833 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
| 8 | fveq1 6833 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦)) | |
| 9 | 7, 8 | breq12d 5111 | . . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) ≲ (𝑓‘𝑦) ↔ (𝐹‘𝑥) ≲ (𝐹‘𝑦))) |
| 10 | 9 | imbi2d 340 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦)) ↔ (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
| 11 | 10 | 2ralbidv 3200 | . . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
| 12 | 11 | elrab 3646 | . . 3 ⊢ (𝐹 ∈ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝑓‘𝑥) ≲ (𝑓‘𝑦))} ↔ (𝐹 ∈ (𝐵 ↑m 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
| 13 | 6, 12 | bitrdi 287 | . 2 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐹 ∈ (𝑉Monot𝑊) ↔ (𝐹 ∈ (𝐵 ↑m 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦))))) |
| 14 | 2 | fvexi 6848 | . . . 4 ⊢ 𝐵 ∈ V |
| 15 | 1 | fvexi 6848 | . . . 4 ⊢ 𝐴 ∈ V |
| 16 | 14, 15 | elmap 8809 | . . 3 ⊢ (𝐹 ∈ (𝐵 ↑m 𝐴) ↔ 𝐹:𝐴⟶𝐵) |
| 17 | 16 | anbi1i 624 | . 2 ⊢ ((𝐹 ∈ (𝐵 ↑m 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦))) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦)))) |
| 18 | 13, 17 | bitrdi 287 | 1 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝑊 ∈ 𝑌) → (𝐹 ∈ (𝑉Monot𝑊) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≤ 𝑦 → (𝐹‘𝑥) ≲ (𝐹‘𝑦))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 {crab 3399 class class class wbr 5098 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 ↑m cmap 8763 Basecbs 17136 lecple 17184 Monotcmnt 33060 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-map 8765 df-mnt 33062 |
| This theorem is referenced by: ismntd 33066 mntf 33067 mgcmnt1d 33079 mgcmnt2d 33080 |
| Copyright terms: Public domain | W3C validator |