Theorem isat3 40188

Description: The predicate "is an atom". (elat2 32829 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 2762	. . . 4 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
4		isat3.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
5	1, 2, 3, 4	isat 40167	. . 3 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 ↔ (𝑃 ∈ 𝐵 ∧ 0 ( ⋖ ‘𝐾)𝑃)))
6		simpl 488	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → 𝐾 ∈ AtLat)
7	1, 2	atl0cl 40184	. . . . . . 7 ⊢ (𝐾 ∈ AtLat → 0 ∈ 𝐵)
8	7	adantr 486	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → 0 ∈ 𝐵)
9		simpr 490	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → 𝑃 ∈ 𝐵)
10		isat3.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
11		eqid 2762	. . . . . . 7 ⊢ (lt‘𝐾) = (lt‘𝐾)
12	1, 10, 11, 3	cvrval2 40155	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 0 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵) → ( 0 ( ⋖ ‘𝐾)𝑃 ↔ ( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃))))
13	6, 8, 9, 12	syl3anc 1398	. . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → ( 0 ( ⋖ ‘𝐾)𝑃 ↔ ( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃))))
14	1, 11, 2	atlltn0 40187	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → ( 0 (lt‘𝐾)𝑃 ↔ 𝑃 ≠ 0 ))
15	1, 11, 2	atlltn0 40187	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ AtLat ∧ 𝑥 ∈ 𝐵) → ( 0 (lt‘𝐾)𝑥 ↔ 𝑥 ≠ 0 ))
16	15	adantlr 728	. . . . . . . . . 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 456	. . . . . . . . 9 ⊢ ((( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ ( 0 (lt‘𝐾)𝑥 → (𝑥 ≤ 𝑃 → 𝑥 = 𝑃)))
20		bi2.04 392	. . . . . . . . 9 ⊢ (( 0 (lt‘𝐾)𝑥 → (𝑥 ≤ 𝑃 → 𝑥 = 𝑃)) ↔ (𝑥 ≤ 𝑃 → ( 0 (lt‘𝐾)𝑥 → 𝑥 = 𝑃)))
21	19, 20	bitri 278	. . . . . . . 8 ⊢ ((( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ (𝑥 ≤ 𝑃 → ( 0 (lt‘𝐾)𝑥 → 𝑥 = 𝑃)))
22		orcom 884	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑃 ∨ 𝑥 = 0 ) ↔ (𝑥 = 0 ∨ 𝑥 = 𝑃))
23		neor 3049	. . . . . . . . . 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 3185	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃) ↔ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))))
28	14, 27	anbi12d 644	. . . . 5 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → (( 0 (lt‘𝐾)𝑃 ∧ ∀𝑥 ∈ 𝐵 (( 0 (lt‘𝐾)𝑥 ∧ 𝑥 ≤ 𝑃) → 𝑥 = 𝑃)) ↔ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))))
29	13, 28	bitr2d 283	. . . 4 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐵) → ((𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))) ↔ 0 ( ⋖ ‘𝐾)𝑃))
30	29	pm5.32da 590	. . 3 ⊢ (𝐾 ∈ AtLat → ((𝑃 ∈ 𝐵 ∧ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))) ↔ (𝑃 ∈ 𝐵 ∧ 0 ( ⋖ ‘𝐾)𝑃)))
31	5, 30	bitr4d 285	. 2 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 ↔ (𝑃 ∈ 𝐵 ∧ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))))))
32		3anass 1111	. 2 ⊢ ((𝑃 ∈ 𝐵 ∧ 𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 ))) ↔ (𝑃 ∈ 𝐵 ∧ (𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))))
33	31, 32	bitr4di 292	1 ⊢ (𝐾 ∈ AtLat → (𝑃 ∈ 𝐴 ↔ (𝑃 ∈ 𝐵 ∧ 𝑃 ≠ 0 ∧ ∀𝑥 ∈ 𝐵 (𝑥 ≤ 𝑃 → (𝑥 = 𝑃 ∨ 𝑥 = 0 )))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078   class class class wbr 5107  ‘cfv 6537  Basecbs 17307  lecple 17355  ltcplt 18402  0.cp0 18515   ⋖ ccvr 40143  Atomscatm 40144  AtLatcal 40145

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-plt 18422  df-glb 18439  df-p0 18517  df-covers 40147  df-ats 40148  df-atl 40179

This theorem is used by:  atn0  40189  dihlspsnat  42214