Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lautle Structured version   Visualization version   GIF version

Theorem lautle 41278
Description: Less-than or equal property of a lattice automorphism. (Contributed by NM, 19-May-2012.)
Hypotheses
Ref Expression
lautset.b 𝐵 = (Base‘𝐾)
lautset.l ≤ = (le‘𝐾)
lautset.i 𝐼 = (LAut‘𝐾)
Assertion
Ref Expression
lautle (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ≤ 𝑌 ↔ (𝐹‘𝑋) ≤ (𝐹‘𝑌)))

Proof of Theorem lautle
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lautset.b . . . 4 𝐵 = (Base‘𝐾)
2 lautset.l . . . 4 ≤ = (le‘𝐾)
3 lautset.i . . . 4 𝐼 = (LAut‘𝐾)
41, 2, 3islaut 41277 . . 3 (𝐾 ∈ 𝑉 → (𝐹 ∈ 𝐼 ↔ (𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦)))))
54simplbda 505 . 2 ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦)))
6 breq1 5105 . . . 4 (𝑥 = 𝑋 → (𝑥 ≤ 𝑦 ↔ 𝑋 ≤ 𝑦))
7 fveq2 6890 . . . . 5 (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
87breq1d 5112 . . . 4 (𝑥 = 𝑋 → ((𝐹‘𝑥) ≤ (𝐹‘𝑦) ↔ (𝐹‘𝑋) ≤ (𝐹‘𝑦)))
96, 8bibi12d 348 . . 3 (𝑥 = 𝑋 → ((𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) ↔ (𝑋 ≤ 𝑦 ↔ (𝐹‘𝑋) ≤ (𝐹‘𝑦))))
10 breq2 5106 . . . 4 (𝑦 = 𝑌 → (𝑋 ≤ 𝑦 ↔ 𝑋 ≤ 𝑌))
11 fveq2 6890 . . . . 5 (𝑦 = 𝑌 → (𝐹‘𝑦) = (𝐹‘𝑌))
1211breq2d 5114 . . . 4 (𝑦 = 𝑌 → ((𝐹‘𝑋) ≤ (𝐹‘𝑦) ↔ (𝐹‘𝑋) ≤ (𝐹‘𝑌)))
1310, 12bibi12d 348 . . 3 (𝑦 = 𝑌 → ((𝑋 ≤ 𝑦 ↔ (𝐹‘𝑋) ≤ (𝐹‘𝑦)) ↔ (𝑋 ≤ 𝑌 ↔ (𝐹‘𝑋) ≤ (𝐹‘𝑌))))
149, 13rspc2v 3586 . 2 ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦)) → (𝑋 ≤ 𝑌 ↔ (𝐹‘𝑋) ≤ (𝐹‘𝑌))))
155, 14mpan9 516 1 (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋 ≤ 𝑌 ↔ (𝐹‘𝑋) ≤ (𝐹‘𝑌)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076   class class class wbr 5102  –1-1-onto→wf1o 6542  ‘cfv 6543  Basecbs 17396  lecple 17444  LAutclaut 41179
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-map 8857  df-laut 41183
This theorem is used by:  lautcnvle  41283  lautlt  41285  lautj  41287  lautm  41288  lauteq  41289  lautco  41291  ltrnle  41323
  Copyright terms: Public domain W3C validator