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

Theorem isat3 39429
Description: The predicate "is an atom". (elat2 32324 analog.) (Contributed by NM, 27-Apr-2014.)
Hypotheses
Ref Expression
isat3.b 𝐵 = (Base‘𝐾)
isat3.l = (le‘𝐾)
isat3.z 0 = (0.‘𝐾)
isat3.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
isat3 (𝐾 ∈ AtLat → (𝑃𝐴 ↔ (𝑃𝐵𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )))))
Distinct variable groups:   𝑥,𝐵   𝑥,𝐾   𝑥,𝑃   𝑥, 0
Allowed substitution hints:   𝐴(𝑥)   (𝑥)

Proof of Theorem isat3
StepHypRef Expression
1 isat3.b . . . 4 𝐵 = (Base‘𝐾)
2 isat3.z . . . 4 0 = (0.‘𝐾)
3 eqid 2733 . . . 4 ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
4 isat3.a . . . 4 𝐴 = (Atoms‘𝐾)
51, 2, 3, 4isat 39408 . . 3 (𝐾 ∈ AtLat → (𝑃𝐴 ↔ (𝑃𝐵0 ( ⋖ ‘𝐾)𝑃)))
6 simpl 482 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → 𝐾 ∈ AtLat)
71, 2atl0cl 39425 . . . . . . 7 (𝐾 ∈ AtLat → 0𝐵)
87adantr 480 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → 0𝐵)
9 simpr 484 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → 𝑃𝐵)
10 isat3.l . . . . . . 7 = (le‘𝐾)
11 eqid 2733 . . . . . . 7 (lt‘𝐾) = (lt‘𝐾)
121, 10, 11, 3cvrval2 39396 . . . . . 6 ((𝐾 ∈ AtLat ∧ 0𝐵𝑃𝐵) → ( 0 ( ⋖ ‘𝐾)𝑃 ↔ ( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥𝐵 (( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃))))
136, 8, 9, 12syl3anc 1373 . . . . 5 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → ( 0 ( ⋖ ‘𝐾)𝑃 ↔ ( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥𝐵 (( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃))))
141, 11, 2atlltn0 39428 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → ( 0 (lt‘𝐾)𝑃𝑃0 ))
151, 11, 2atlltn0 39428 . . . . . . . . . . 11 ((𝐾 ∈ AtLat ∧ 𝑥𝐵) → ( 0 (lt‘𝐾)𝑥𝑥0 ))
1615adantlr 715 . . . . . . . . . 10 (((𝐾 ∈ AtLat ∧ 𝑃𝐵) ∧ 𝑥𝐵) → ( 0 (lt‘𝐾)𝑥𝑥0 ))
1716imbi1d 341 . . . . . . . . 9 (((𝐾 ∈ AtLat ∧ 𝑃𝐵) ∧ 𝑥𝐵) → (( 0 (lt‘𝐾)𝑥𝑥 = 𝑃) ↔ (𝑥0𝑥 = 𝑃)))
1817imbi2d 340 . . . . . . . 8 (((𝐾 ∈ AtLat ∧ 𝑃𝐵) ∧ 𝑥𝐵) → ((𝑥 𝑃 → ( 0 (lt‘𝐾)𝑥𝑥 = 𝑃)) ↔ (𝑥 𝑃 → (𝑥0𝑥 = 𝑃))))
19 impexp 450 . . . . . . . . 9 ((( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃) ↔ ( 0 (lt‘𝐾)𝑥 → (𝑥 𝑃𝑥 = 𝑃)))
20 bi2.04 387 . . . . . . . . 9 (( 0 (lt‘𝐾)𝑥 → (𝑥 𝑃𝑥 = 𝑃)) ↔ (𝑥 𝑃 → ( 0 (lt‘𝐾)𝑥𝑥 = 𝑃)))
2119, 20bitri 275 . . . . . . . 8 ((( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃) ↔ (𝑥 𝑃 → ( 0 (lt‘𝐾)𝑥𝑥 = 𝑃)))
22 orcom 870 . . . . . . . . . 10 ((𝑥 = 𝑃𝑥 = 0 ) ↔ (𝑥 = 0𝑥 = 𝑃))
23 neor 3021 . . . . . . . . . 10 ((𝑥 = 0𝑥 = 𝑃) ↔ (𝑥0𝑥 = 𝑃))
2422, 23bitri 275 . . . . . . . . 9 ((𝑥 = 𝑃𝑥 = 0 ) ↔ (𝑥0𝑥 = 𝑃))
2524imbi2i 336 . . . . . . . 8 ((𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )) ↔ (𝑥 𝑃 → (𝑥0𝑥 = 𝑃)))
2618, 21, 253bitr4g 314 . . . . . . 7 (((𝐾 ∈ AtLat ∧ 𝑃𝐵) ∧ 𝑥𝐵) → ((( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃) ↔ (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 ))))
2726ralbidva 3154 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → (∀𝑥𝐵 (( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃) ↔ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 ))))
2814, 27anbi12d 632 . . . . 5 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → (( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥𝐵 (( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃)) ↔ (𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )))))
2913, 28bitr2d 280 . . . 4 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → ((𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 ))) ↔ 0 ( ⋖ ‘𝐾)𝑃))
3029pm5.32da 579 . . 3 (𝐾 ∈ AtLat → ((𝑃𝐵 ∧ (𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )))) ↔ (𝑃𝐵0 ( ⋖ ‘𝐾)𝑃)))
315, 30bitr4d 282 . 2 (𝐾 ∈ AtLat → (𝑃𝐴 ↔ (𝑃𝐵 ∧ (𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 ))))))
32 3anass 1094 . 2 ((𝑃𝐵𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 ))) ↔ (𝑃𝐵 ∧ (𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )))))
3331, 32bitr4di 289 1 (𝐾 ∈ AtLat → (𝑃𝐴 ↔ (𝑃𝐵𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 847  w3a 1086   = wceq 1541  wcel 2113  wne 2929  wral 3048   class class class wbr 5095  cfv 6488  Basecbs 17124  lecple 17172  ltcplt 18218  0.cp0 18331  ccvr 39384  Atomscatm 39385  AtLatcal 39386
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7676
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  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 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-riota 7311  df-plt 18238  df-glb 18255  df-p0 18333  df-covers 39388  df-ats 39389  df-atl 39420
This theorem is referenced by:  atn0  39430  dihlspsnat  41455
  Copyright terms: Public domain W3C validator