Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > meetle | Structured version Visualization version GIF version |
Description: A meet is less than or equal to a third value iff each argument is less than or equal to the third value. (Contributed by NM, 16-Sep-2011.) (Revised by NM, 12-Sep-2018.) |
Ref | Expression |
---|---|
meetle.b | ⊢ 𝐵 = (Base‘𝐾) |
meetle.l | ⊢ ≤ = (le‘𝐾) |
meetle.m | ⊢ ∧ = (meet‘𝐾) |
meetle.k | ⊢ (𝜑 → 𝐾 ∈ Poset) |
meetle.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
meetle.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
meetle.z | ⊢ (𝜑 → 𝑍 ∈ 𝐵) |
meetle.e | ⊢ (𝜑 → 〈𝑋, 𝑌〉 ∈ dom ∧ ) |
Ref | Expression |
---|---|
meetle | ⊢ (𝜑 → ((𝑍 ≤ 𝑋 ∧ 𝑍 ≤ 𝑌) ↔ 𝑍 ≤ (𝑋 ∧ 𝑌))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq1 5069 | . . . . 5 ⊢ (𝑧 = 𝑍 → (𝑧 ≤ 𝑋 ↔ 𝑍 ≤ 𝑋)) | |
2 | breq1 5069 | . . . . 5 ⊢ (𝑧 = 𝑍 → (𝑧 ≤ 𝑌 ↔ 𝑍 ≤ 𝑌)) | |
3 | 1, 2 | anbi12d 632 | . . . 4 ⊢ (𝑧 = 𝑍 → ((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) ↔ (𝑍 ≤ 𝑋 ∧ 𝑍 ≤ 𝑌))) |
4 | breq1 5069 | . . . 4 ⊢ (𝑧 = 𝑍 → (𝑧 ≤ (𝑋 ∧ 𝑌) ↔ 𝑍 ≤ (𝑋 ∧ 𝑌))) | |
5 | 3, 4 | imbi12d 347 | . . 3 ⊢ (𝑧 = 𝑍 → (((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) → 𝑧 ≤ (𝑋 ∧ 𝑌)) ↔ ((𝑍 ≤ 𝑋 ∧ 𝑍 ≤ 𝑌) → 𝑍 ≤ (𝑋 ∧ 𝑌)))) |
6 | meetle.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
7 | meetle.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
8 | meetle.m | . . . . 5 ⊢ ∧ = (meet‘𝐾) | |
9 | meetle.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ Poset) | |
10 | meetle.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
11 | meetle.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
12 | meetle.e | . . . . 5 ⊢ (𝜑 → 〈𝑋, 𝑌〉 ∈ dom ∧ ) | |
13 | 6, 7, 8, 9, 10, 11, 12 | meetlem 17635 | . . . 4 ⊢ (𝜑 → (((𝑋 ∧ 𝑌) ≤ 𝑋 ∧ (𝑋 ∧ 𝑌) ≤ 𝑌) ∧ ∀𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) → 𝑧 ≤ (𝑋 ∧ 𝑌)))) |
14 | 13 | simprd 498 | . . 3 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ((𝑧 ≤ 𝑋 ∧ 𝑧 ≤ 𝑌) → 𝑧 ≤ (𝑋 ∧ 𝑌))) |
15 | meetle.z | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐵) | |
16 | 5, 14, 15 | rspcdva 3625 | . 2 ⊢ (𝜑 → ((𝑍 ≤ 𝑋 ∧ 𝑍 ≤ 𝑌) → 𝑍 ≤ (𝑋 ∧ 𝑌))) |
17 | 6, 7, 8, 9, 10, 11, 12 | lemeet1 17636 | . . . 4 ⊢ (𝜑 → (𝑋 ∧ 𝑌) ≤ 𝑋) |
18 | 6, 8, 9, 10, 11, 12 | meetcl 17630 | . . . . 5 ⊢ (𝜑 → (𝑋 ∧ 𝑌) ∈ 𝐵) |
19 | 6, 7 | postr 17563 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ (𝑍 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑍 ≤ (𝑋 ∧ 𝑌) ∧ (𝑋 ∧ 𝑌) ≤ 𝑋) → 𝑍 ≤ 𝑋)) |
20 | 9, 15, 18, 10, 19 | syl13anc 1368 | . . . 4 ⊢ (𝜑 → ((𝑍 ≤ (𝑋 ∧ 𝑌) ∧ (𝑋 ∧ 𝑌) ≤ 𝑋) → 𝑍 ≤ 𝑋)) |
21 | 17, 20 | mpan2d 692 | . . 3 ⊢ (𝜑 → (𝑍 ≤ (𝑋 ∧ 𝑌) → 𝑍 ≤ 𝑋)) |
22 | 6, 7, 8, 9, 10, 11, 12 | lemeet2 17637 | . . . 4 ⊢ (𝜑 → (𝑋 ∧ 𝑌) ≤ 𝑌) |
23 | 6, 7 | postr 17563 | . . . . 5 ⊢ ((𝐾 ∈ Poset ∧ (𝑍 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑍 ≤ (𝑋 ∧ 𝑌) ∧ (𝑋 ∧ 𝑌) ≤ 𝑌) → 𝑍 ≤ 𝑌)) |
24 | 9, 15, 18, 11, 23 | syl13anc 1368 | . . . 4 ⊢ (𝜑 → ((𝑍 ≤ (𝑋 ∧ 𝑌) ∧ (𝑋 ∧ 𝑌) ≤ 𝑌) → 𝑍 ≤ 𝑌)) |
25 | 22, 24 | mpan2d 692 | . . 3 ⊢ (𝜑 → (𝑍 ≤ (𝑋 ∧ 𝑌) → 𝑍 ≤ 𝑌)) |
26 | 21, 25 | jcad 515 | . 2 ⊢ (𝜑 → (𝑍 ≤ (𝑋 ∧ 𝑌) → (𝑍 ≤ 𝑋 ∧ 𝑍 ≤ 𝑌))) |
27 | 16, 26 | impbid 214 | 1 ⊢ (𝜑 → ((𝑍 ≤ 𝑋 ∧ 𝑍 ≤ 𝑌) ↔ 𝑍 ≤ (𝑋 ∧ 𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∀wral 3138 〈cop 4573 class class class wbr 5066 dom cdm 5555 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 lecple 16572 Posetcpo 17550 meetcmee 17555 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-poset 17556 df-glb 17585 df-meet 17587 |
This theorem is referenced by: latlem12 17688 |
Copyright terms: Public domain | W3C validator |