| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lautcnvle | Structured version Visualization version GIF version | ||
| Description: Less-than or equal property of lattice automorphism converse. (Contributed by NM, 19-May-2012.) |
| Ref | Expression |
|---|---|
| lautcnvle.b | ⊢ 𝐵 = (Base‘𝐾) |
| lautcnvle.l | ⊢ ≤ = (le‘𝐾) |
| lautcnvle.i | ⊢ 𝐼 = (LAut‘𝐾) |
| Ref | Expression |
|---|---|
| lautcnvle | ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ≤ 𝑌 ↔ (◡𝐹‘𝑋) ≤ (◡𝐹‘𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 484 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼)) | |
| 2 | lautcnvle.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 3 | lautcnvle.i | . . . . . 6 ⊢ 𝐼 = (LAut‘𝐾) | |
| 4 | 2, 3 | laut1o 40592 | . . . . 5 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → 𝐹:𝐵–1-1-onto→𝐵) |
| 5 | 4 | adantr 482 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐹:𝐵–1-1-onto→𝐵) |
| 6 | simprl 777 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 7 | f1ocnvdm 7233 | . . . 4 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐵) → (◡𝐹‘𝑋) ∈ 𝐵) | |
| 8 | 5, 6, 7 | syl2anc 591 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (◡𝐹‘𝑋) ∈ 𝐵) |
| 9 | simprr 779 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 10 | f1ocnvdm 7233 | . . . 4 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ 𝑌 ∈ 𝐵) → (◡𝐹‘𝑌) ∈ 𝐵) | |
| 11 | 5, 9, 10 | syl2anc 591 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (◡𝐹‘𝑌) ∈ 𝐵) |
| 12 | lautcnvle.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 13 | 2, 12, 3 | lautle 40591 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ ((◡𝐹‘𝑋) ∈ 𝐵 ∧ (◡𝐹‘𝑌) ∈ 𝐵)) → ((◡𝐹‘𝑋) ≤ (◡𝐹‘𝑌) ↔ (𝐹‘(◡𝐹‘𝑋)) ≤ (𝐹‘(◡𝐹‘𝑌)))) |
| 14 | 1, 8, 11, 13 | syl12anc 843 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((◡𝐹‘𝑋) ≤ (◡𝐹‘𝑌) ↔ (𝐹‘(◡𝐹‘𝑋)) ≤ (𝐹‘(◡𝐹‘𝑌)))) |
| 15 | f1ocnvfv2 7225 | . . . 4 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐵) → (𝐹‘(◡𝐹‘𝑋)) = 𝑋) | |
| 16 | 5, 6, 15 | syl2anc 591 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐹‘(◡𝐹‘𝑋)) = 𝑋) |
| 17 | f1ocnvfv2 7225 | . . . 4 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(◡𝐹‘𝑌)) = 𝑌) | |
| 18 | 5, 9, 17 | syl2anc 591 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐹‘(◡𝐹‘𝑌)) = 𝑌) |
| 19 | 16, 18 | breq12d 5088 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝐹‘(◡𝐹‘𝑋)) ≤ (𝐹‘(◡𝐹‘𝑌)) ↔ 𝑋 ≤ 𝑌)) |
| 20 | 14, 19 | bitr2d 282 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ≤ 𝑌 ↔ (◡𝐹‘𝑋) ≤ (◡𝐹‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 = wceq 1548 ∈ wcel 2121 class class class wbr 5075 ◡ccnv 5620 –1-1-onto→wf1o 6488 ‘cfv 6489 Basecbs 17174 lecple 17222 LAutclaut 40492 |
| 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 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-ov 7363 df-oprab 7364 df-mpo 7365 df-map 8769 df-laut 40496 |
| This theorem is referenced by: lautcnv 40597 lautj 40600 lautm 40601 ltrncnvleN 40637 ltrneq2 40655 |
| Copyright terms: Public domain | W3C validator |