Theorem isat3 39938

Description: The predicate "is an atom". (elat2 32597 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

Step	Hyp	Ref	Expression
1		isat3.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		isat3.z	. . . 4 ⊢ 0 = (0.‘𝐾)
3		eqid 2765	. . . 4 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
4		isat3.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
5	1, 2, 3, 4	isat 39917	. . 3 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 ↔ (𝑃 ∈ 𝐵 ∧ 0 ( ⋖ ‘𝐾)𝑃)))
6		simpl 487	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → 𝐾 ∈ AtLat)
7	1, 2	atl0cl 39934	. . . . . . 7 ⊢ (𝐾 ∈ AtLat → 0 ∈ 𝐵)
8	7	adantr 485	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → 0 ∈ 𝐵)
9		simpr 489	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → 𝑃 ∈ 𝐵)
10		isat3.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
11		eqid 2765	. . . . . . 7 ⊢ (lt‘𝐾) = (lt‘𝐾)
12	1, 10, 11, 3	cvrval2 39905	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵) → ( 0 ( ⋖ ‘𝐾)𝑃 ↔ ( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃))))
13	6, 8, 9, 12	syl3anc 1394	. . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → ( 0 ( ⋖ ‘𝐾)𝑃 ↔ ( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃))))
14	1, 11, 2	atlltn0 39937	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → ( 0 (lt‘𝐾)𝑃 ↔ 𝑃 ≠ 0 ))
15	1, 11, 2	atlltn0 39937	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ AtLat ∧ 𝑥 ∈ 𝐵) → ( 0 (lt‘𝐾)𝑥 ↔ 𝑥 ≠ 0 ))
16	15	adantlr 727	. . . . . . . . . 10 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ( 0 (lt‘𝐾)𝑥 ↔ 𝑥 ≠ 0 ))
17	16	imbi1d 344	. . . . . . . . 9 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → (( 0 (lt‘𝐾)𝑥 → 𝑥 = 𝑃) ↔ (𝑥 ≠ 0 → 𝑥 = 𝑃)))
18	17	imbi2d 343	. . . . . . . 8 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 ≤ 𝑃 → ( 0 (lt‘𝐾)𝑥 → 𝑥 = 𝑃)) ↔ (𝑥 ≤ 𝑃 → (𝑥 ≠ 0 → 𝑥 = 𝑃))))
19		impexp 455	. . . . . . . . 9 ⊢ ((( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ ( 0 (lt‘𝐾)𝑥 → (𝑥 ≤ 𝑃 → 𝑥 = 𝑃)))
20		bi2.04 391	. . . . . . . . 9 ⊢ (( 0 (lt‘𝐾)𝑥 → (𝑥 ≤ 𝑃 → 𝑥 = 𝑃)) ↔ (𝑥 ≤ 𝑃 → ( 0 (lt‘𝐾)𝑥 → 𝑥 = 𝑃)))
21	19, 20	bitri 278	. . . . . . . 8 ⊢ ((( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ (𝑥 ≤ 𝑃 → ( 0 (lt‘𝐾)𝑥 → 𝑥 = 𝑃)))
22		orcom 883	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑃 ∨ 𝑥 = 0 ) ↔ (𝑥 = 0 ∨ 𝑥 = 𝑃))
23		neor 3052	. . . . . . . . . 10 ⊢ ((𝑥 = 0 ∨ 𝑥 = 𝑃) ↔ (𝑥 ≠ 0 → 𝑥 = 𝑃))
24	22, 23	bitri 278	. . . . . . . . 9 ⊢ ((𝑥 = 𝑃 ∨ 𝑥 = 0 ) ↔ (𝑥 ≠ 0 → 𝑥 = 𝑃))
25	24	imbi2i 339	. . . . . . . 8 ⊢ ((𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )) ↔ (𝑥 ≤ 𝑃 → (𝑥 ≠ 0 → 𝑥 = 𝑃)))
26	18, 21, 25	3bitr4g 317	. . . . . . 7 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))))
27	26	ralbidva 3186	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))))
28	14, 27	anbi12d 643	. . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → (( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃)) ↔ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))))
29	13, 28	bitr2d 283	. . . 4 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → ((𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))) ↔ 0 ( ⋖ ‘𝐾)𝑃))
30	29	pm5.32da 589	. . 3 ⊢ (𝐾 ∈ AtLat → ((𝑃 ∈ 𝐵 ∧ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))) ↔ (𝑃 ∈ 𝐵 ∧ 0 ( ⋖ ‘𝐾)𝑃)))
31	5, 30	bitr4d 285	. 2 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 ↔ (𝑃 ∈ 𝐵 ∧ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))))))
32		3anass 1109	. 2 ⊢ ((𝑃 ∈ 𝐵 ∧ 𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))) ↔ (𝑃 ∈ 𝐵 ∧ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))))
33	31, 32	bitr4di 292	1 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 ↔ (𝑃 ∈ 𝐵 ∧ 𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145   ≠ wne 2960  ∀wral 3079   class class class wbr 5104  ‘cfv 6525  Basecbs 17257  lecple 17305  ltcplt 18352  0.cp0 18465   ⋖ ccvr 39893  Atomscatm 39894  AtLatcal 39895

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5231  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5105  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 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-riota 7357  df-plt 18372  df-glb 18389  df-p0 18467  df-covers 39897  df-ats 39898  df-atl 39929

This theorem is referenced by:  atn0  39939  dihlspsnat  41964