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 39891
Description: The predicate "is an atom". (elat2 32499 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 2761 . . . 4 ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
4 isat3.a . . . 4 𝐴 = (Atoms‘𝐾)
51, 2, 3, 4isat 39870 . . 3 (𝐾 ∈ AtLat → (𝑃𝐴 ↔ (𝑃𝐵0 ( ⋖ ‘𝐾)𝑃)))
6 simpl 486 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → 𝐾 ∈ AtLat)
71, 2atl0cl 39887 . . . . . . 7 (𝐾 ∈ AtLat → 0𝐵)
87adantr 484 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → 0𝐵)
9 simpr 488 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → 𝑃𝐵)
10 isat3.l . . . . . . 7 = (le‘𝐾)
11 eqid 2761 . . . . . . 7 (lt‘𝐾) = (lt‘𝐾)
121, 10, 11, 3cvrval2 39858 . . . . . 6 ((𝐾 ∈ AtLat ∧ 0𝐵𝑃𝐵) → ( 0 ( ⋖ ‘𝐾)𝑃 ↔ ( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥𝐵 (( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃))))
136, 8, 9, 12syl3anc 1389 . . . . 5 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → ( 0 ( ⋖ ‘𝐾)𝑃 ↔ ( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥𝐵 (( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃))))
141, 11, 2atlltn0 39890 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → ( 0 (lt‘𝐾)𝑃𝑃0 ))
151, 11, 2atlltn0 39890 . . . . . . . . . . 11 ((𝐾 ∈ AtLat ∧ 𝑥𝐵) → ( 0 (lt‘𝐾)𝑥𝑥0 ))
1615adantlr 725 . . . . . . . . . 10 (((𝐾 ∈ AtLat ∧ 𝑃𝐵) ∧ 𝑥𝐵) → ( 0 (lt‘𝐾)𝑥𝑥0 ))
1716imbi1d 343 . . . . . . . . 9 (((𝐾 ∈ AtLat ∧ 𝑃𝐵) ∧ 𝑥𝐵) → (( 0 (lt‘𝐾)𝑥𝑥 = 𝑃) ↔ (𝑥0𝑥 = 𝑃)))
1817imbi2d 342 . . . . . . . 8 (((𝐾 ∈ AtLat ∧ 𝑃𝐵) ∧ 𝑥𝐵) → ((𝑥 𝑃 → ( 0 (lt‘𝐾)𝑥𝑥 = 𝑃)) ↔ (𝑥 𝑃 → (𝑥0𝑥 = 𝑃))))
19 impexp 454 . . . . . . . . 9 ((( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃) ↔ ( 0 (lt‘𝐾)𝑥 → (𝑥 𝑃𝑥 = 𝑃)))
20 bi2.04 390 . . . . . . . . 9 (( 0 (lt‘𝐾)𝑥 → (𝑥 𝑃𝑥 = 𝑃)) ↔ (𝑥 𝑃 → ( 0 (lt‘𝐾)𝑥𝑥 = 𝑃)))
2119, 20bitri 277 . . . . . . . 8 ((( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃) ↔ (𝑥 𝑃 → ( 0 (lt‘𝐾)𝑥𝑥 = 𝑃)))
22 orcom 881 . . . . . . . . . 10 ((𝑥 = 𝑃𝑥 = 0 ) ↔ (𝑥 = 0𝑥 = 𝑃))
23 neor 3048 . . . . . . . . . 10 ((𝑥 = 0𝑥 = 𝑃) ↔ (𝑥0𝑥 = 𝑃))
2422, 23bitri 277 . . . . . . . . 9 ((𝑥 = 𝑃𝑥 = 0 ) ↔ (𝑥0𝑥 = 𝑃))
2524imbi2i 338 . . . . . . . 8 ((𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )) ↔ (𝑥 𝑃 → (𝑥0𝑥 = 𝑃)))
2618, 21, 253bitr4g 316 . . . . . . 7 (((𝐾 ∈ AtLat ∧ 𝑃𝐵) ∧ 𝑥𝐵) → ((( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃) ↔ (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 ))))
2726ralbidva 3182 . . . . . 6 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → (∀𝑥𝐵 (( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃) ↔ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 ))))
2814, 27anbi12d 641 . . . . 5 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → (( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥𝐵 (( 0 (lt‘𝐾)𝑥𝑥 𝑃) → 𝑥 = 𝑃)) ↔ (𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )))))
2913, 28bitr2d 282 . . . 4 ((𝐾 ∈ AtLat ∧ 𝑃𝐵) → ((𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 ))) ↔ 0 ( ⋖ ‘𝐾)𝑃))
3029pm5.32da 587 . . 3 (𝐾 ∈ AtLat → ((𝑃𝐵 ∧ (𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )))) ↔ (𝑃𝐵0 ( ⋖ ‘𝐾)𝑃)))
315, 30bitr4d 284 . 2 (𝐾 ∈ AtLat → (𝑃𝐴 ↔ (𝑃𝐵 ∧ (𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 ))))))
32 3anass 1105 . 2 ((𝑃𝐵𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 ))) ↔ (𝑃𝐵 ∧ (𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )))))
3331, 32bitr4di 291 1 (𝐾 ∈ AtLat → (𝑃𝐴 ↔ (𝑃𝐵𝑃0 ∧ ∀𝑥𝐵 (𝑥 𝑃 → (𝑥 = 𝑃𝑥 = 0 )))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  wo 858  w3a 1097   = wceq 1559  wcel 2141  wne 2956  wral 3075   class class class wbr 5097  cfv 6515  Basecbs 17235  lecple 17283  ltcplt 18330  0.cp0 18443  ccvr 39846  Atomscatm 39847  AtLatcal 39848
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7712
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-riota 7347  df-plt 18350  df-glb 18367  df-p0 18445  df-covers 39850  df-ats 39851  df-atl 39882
This theorem is referenced by:  atn0  39892  dihlspsnat  41917
  Copyright terms: Public domain W3C validator