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

Theorem hl0lt1N 39393
Description: Lattice 0 is less than lattice 1 in a Hilbert lattice. (Contributed by NM, 4-Dec-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
hl0lt1.s < = (lt‘𝐾)
hl0lt1.z 0 = (0.‘𝐾)
hl0lt1.u 1 = (1.‘𝐾)
Assertion
Ref Expression
hl0lt1N (𝐾 ∈ HL → 0 < 1 )

Proof of Theorem hl0lt1N
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2736 . . 3 (Base‘𝐾) = (Base‘𝐾)
2 hl0lt1.s . . 3 < = (lt‘𝐾)
3 hl0lt1.z . . 3 0 = (0.‘𝐾)
4 hl0lt1.u . . 3 1 = (1.‘𝐾)
51, 2, 3, 4hlhgt2 39392 . 2 (𝐾 ∈ HL → ∃𝑥 ∈ (Base‘𝐾)( 0 < 𝑥𝑥 < 1 ))
6 hlpos 39368 . . . . 5 (𝐾 ∈ HL → 𝐾 ∈ Poset)
76adantr 480 . . . 4 ((𝐾 ∈ HL ∧ 𝑥 ∈ (Base‘𝐾)) → 𝐾 ∈ Poset)
8 hlop 39364 . . . . . 6 (𝐾 ∈ HL → 𝐾 ∈ OP)
98adantr 480 . . . . 5 ((𝐾 ∈ HL ∧ 𝑥 ∈ (Base‘𝐾)) → 𝐾 ∈ OP)
101, 3op0cl 39186 . . . . 5 (𝐾 ∈ OP → 0 ∈ (Base‘𝐾))
119, 10syl 17 . . . 4 ((𝐾 ∈ HL ∧ 𝑥 ∈ (Base‘𝐾)) → 0 ∈ (Base‘𝐾))
12 simpr 484 . . . 4 ((𝐾 ∈ HL ∧ 𝑥 ∈ (Base‘𝐾)) → 𝑥 ∈ (Base‘𝐾))
131, 4op1cl 39187 . . . . 5 (𝐾 ∈ OP → 1 ∈ (Base‘𝐾))
149, 13syl 17 . . . 4 ((𝐾 ∈ HL ∧ 𝑥 ∈ (Base‘𝐾)) → 1 ∈ (Base‘𝐾))
151, 2plttr 18388 . . . 4 ((𝐾 ∈ Poset ∧ ( 0 ∈ (Base‘𝐾) ∧ 𝑥 ∈ (Base‘𝐾) ∧ 1 ∈ (Base‘𝐾))) → (( 0 < 𝑥𝑥 < 1 ) → 0 < 1 ))
167, 11, 12, 14, 15syl13anc 1373 . . 3 ((𝐾 ∈ HL ∧ 𝑥 ∈ (Base‘𝐾)) → (( 0 < 𝑥𝑥 < 1 ) → 0 < 1 ))
1716rexlimdva 3154 . 2 (𝐾 ∈ HL → (∃𝑥 ∈ (Base‘𝐾)( 0 < 𝑥𝑥 < 1 ) → 0 < 1 ))
185, 17mpd 15 1 (𝐾 ∈ HL → 0 < 1 )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1539  wcel 2107  wrex 3069   class class class wbr 5142  cfv 6560  Basecbs 17248  Posetcpo 18354  ltcplt 18355  0.cp0 18469  1.cp1 18470  OPcops 39174  HLchlt 39352
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rmo 3379  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-riota 7389  df-ov 7435  df-proset 18341  df-poset 18360  df-plt 18376  df-lub 18392  df-glb 18393  df-p0 18471  df-p1 18472  df-lat 18478  df-oposet 39178  df-ol 39180  df-oml 39181  df-atl 39300  df-cvlat 39324  df-hlat 39353
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator