Theorem isat3 38165

Description: The predicate "is an atom". (elat2 31580 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 2732	. . . 4 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
4		isat3.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
5	1, 2, 3, 4	isat 38144	. . 3 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 ↔ (𝑃 ∈ 𝐵 ∧ 0 ( ⋖ ‘𝐾)𝑃)))
6		simpl 483	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → 𝐾 ∈ AtLat)
7	1, 2	atl0cl 38161	. . . . . . 7 ⊢ (𝐾 ∈ AtLat → 0 ∈ 𝐵)
8	7	adantr 481	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → 0 ∈ 𝐵)
9		simpr 485	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → 𝑃 ∈ 𝐵)
10		isat3.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
11		eqid 2732	. . . . . . 7 ⊢ (lt‘𝐾) = (lt‘𝐾)
12	1, 10, 11, 3	cvrval2 38132	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵) → ( 0 ( ⋖ ‘𝐾)𝑃 ↔ ( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃))))
13	6, 8, 9, 12	syl3anc 1371	. . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → ( 0 ( ⋖ ‘𝐾)𝑃 ↔ ( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃))))
14	1, 11, 2	atlltn0 38164	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → ( 0 (lt‘𝐾)𝑃 ↔ 𝑃 ≠ 0 ))
15	1, 11, 2	atlltn0 38164	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ AtLat ∧ 𝑥 ∈ 𝐵) → ( 0 (lt‘𝐾)𝑥 ↔ 𝑥 ≠ 0 ))
16	15	adantlr 713	. . . . . . . . . 10 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ( 0 (lt‘𝐾)𝑥 ↔ 𝑥 ≠ 0 ))
17	16	imbi1d 341	. . . . . . . . 9 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → (( 0 (lt‘𝐾)𝑥 → 𝑥 = 𝑃) ↔ (𝑥 ≠ 0 → 𝑥 = 𝑃)))
18	17	imbi2d 340	. . . . . . . 8 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥 ≤ 𝑃 → ( 0 (lt‘𝐾)𝑥 → 𝑥 = 𝑃)) ↔ (𝑥 ≤ 𝑃 → (𝑥 ≠ 0 → 𝑥 = 𝑃))))
19		impexp 451	. . . . . . . . 9 ⊢ ((( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ ( 0 (lt‘𝐾)𝑥 → (𝑥 ≤ 𝑃 → 𝑥 = 𝑃)))
20		bi2.04 388	. . . . . . . . 9 ⊢ (( 0 (lt‘𝐾)𝑥 → (𝑥 ≤ 𝑃 → 𝑥 = 𝑃)) ↔ (𝑥 ≤ 𝑃 → ( 0 (lt‘𝐾)𝑥 → 𝑥 = 𝑃)))
21	19, 20	bitri 274	. . . . . . . 8 ⊢ ((( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ (𝑥 ≤ 𝑃 → ( 0 (lt‘𝐾)𝑥 → 𝑥 = 𝑃)))
22		orcom 868	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑃 ∨ 𝑥 = 0 ) ↔ (𝑥 = 0 ∨ 𝑥 = 𝑃))
23		neor 3034	. . . . . . . . . 10 ⊢ ((𝑥 = 0 ∨ 𝑥 = 𝑃) ↔ (𝑥 ≠ 0 → 𝑥 = 𝑃))
24	22, 23	bitri 274	. . . . . . . . 9 ⊢ ((𝑥 = 𝑃 ∨ 𝑥 = 0 ) ↔ (𝑥 ≠ 0 → 𝑥 = 𝑃))
25	24	imbi2i 335	. . . . . . . 8 ⊢ ((𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )) ↔ (𝑥 ≤ 𝑃 → (𝑥 ≠ 0 → 𝑥 = 𝑃)))
26	18, 21, 25	3bitr4g 313	. . . . . . 7 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))))
27	26	ralbidva 3175	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))))
28	14, 27	anbi12d 631	. . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → (( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃)) ↔ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))))
29	13, 28	bitr2d 279	. . . 4 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → ((𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))) ↔ 0 ( ⋖ ‘𝐾)𝑃))
30	29	pm5.32da 579	. . 3 ⊢ (𝐾 ∈ AtLat → ((𝑃 ∈ 𝐵 ∧ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))) ↔ (𝑃 ∈ 𝐵 ∧ 0 ( ⋖ ‘𝐾)𝑃)))
31	5, 30	bitr4d 281	. 2 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 ↔ (𝑃 ∈ 𝐵 ∧ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))))))
32		3anass 1095	. 2 ⊢ ((𝑃 ∈ 𝐵 ∧ 𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))) ↔ (𝑃 ∈ 𝐵 ∧ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))))
33	31, 32	bitr4di 288	1 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 ↔ (𝑃 ∈ 𝐵 ∧ 𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106   ≠ wne 2940  ∀wral 3061   class class class wbr 5147  ‘cfv 6540  Basecbs 17140  lecple 17200  ltcplt 18257  0.cp0 18372   ⋖ ccvr 38120  Atomscatm 38121  AtLatcal 38122

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7361  df-plt 18279  df-glb 18296  df-p0 18374  df-covers 38124  df-ats 38125  df-atl 38156

This theorem is referenced by:  atn0  38166  dihlspsnat  40192