| 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 488 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼)) | |
| 2 | lautcnvle.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐾) | |
| 3 | lautcnvle.i | . . . . . 6 ⊢ 𝐼 = (LAut‘𝐾) | |
| 4 | 2, 3 | laut1o 41062 | . . . . 5 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → 𝐹:𝐵–1-1-onto→𝐵) |
| 5 | 4 | adantr 486 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐹:𝐵–1-1-onto→𝐵) |
| 6 | simprl 783 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 7 | f1ocnvdm 7281 | . . . 4 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐵) → (◡𝐹‘𝑋) ∈ 𝐵) | |
| 8 | 5, 6, 7 | syl2anc 596 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (◡𝐹‘𝑋) ∈ 𝐵) |
| 9 | simprr 785 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 10 | f1ocnvdm 7281 | . . . 4 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ 𝑌 ∈ 𝐵) → (◡𝐹‘𝑌) ∈ 𝐵) | |
| 11 | 5, 9, 10 | syl2anc 596 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (◡𝐹‘𝑌) ∈ 𝐵) |
| 12 | lautcnvle.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 13 | 2, 12, 3 | lautle 41061 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ ((◡𝐹‘𝑋) ∈ 𝐵 ∧ (◡𝐹‘𝑌) ∈ 𝐵)) → ((◡𝐹‘𝑋) ≤ (◡𝐹‘𝑌) ↔ (𝐹‘(◡𝐹‘𝑋)) ≤ (𝐹‘(◡𝐹‘𝑌)))) |
| 14 | 1, 8, 11, 13 | syl12anc 850 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((◡𝐹‘𝑋) ≤ (◡𝐹‘𝑌) ↔ (𝐹‘(◡𝐹‘𝑋)) ≤ (𝐹‘(◡𝐹‘𝑌)))) |
| 15 | f1ocnvfv2 7273 | . . . 4 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ 𝑋 ∈ 𝐵) → (𝐹‘(◡𝐹‘𝑋)) = 𝑋) | |
| 16 | 5, 6, 15 | syl2anc 596 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐹‘(◡𝐹‘𝑋)) = 𝑋) |
| 17 | f1ocnvfv2 7273 | . . . 4 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(◡𝐹‘𝑌)) = 𝑌) | |
| 18 | 5, 9, 17 | syl2anc 596 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝐹‘(◡𝐹‘𝑌)) = 𝑌) |
| 19 | 16, 18 | breq12d 5115 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝐹‘(◡𝐹‘𝑋)) ≤ (𝐹‘(◡𝐹‘𝑌)) ↔ 𝑋 ≤ 𝑌)) |
| 20 | 14, 19 | bitr2d 283 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ≤ 𝑌 ↔ (◡𝐹‘𝑋) ≤ (◡𝐹‘𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 class class class wbr 5102 ◡ccnv 5646 –1-1-onto→wf1o 6526 ‘cfv 6527 Basecbs 17348 lecple 17396 LAutclaut 40962 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-map 8827 df-laut 40966 |
| This theorem is used by: lautcnv 41067 lautj 41070 lautm 41071 ltrncnvleN 41107 ltrneq2 41125 |
| Copyright terms: Public domain | W3C validator |