Theorem atnle 40468

Description: Two ways of expressing "an atom is not less than or equal to a lattice element." (atnssm0 32984 analog.) (Contributed by NM, 5-Nov-2012.)

Hypotheses

Ref	Expression
atnle.b	⊢ 𝐵 = (Base‘𝐾)
atnle.l	⊢ ≤ = (le‘𝐾)
atnle.m	⊢ ∧ = (meet‘𝐾)
atnle.z	⊢ 0 = (0.‘𝐾)
atnle.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
atnle	⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (¬ 𝑃 ≤ 𝑋 ↔ (𝑃 ∧ 𝑋) = 0 ))

Proof of Theorem atnle

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl1 1210	. . . . . 6 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) ≠ 0 ) → 𝐾 ∈ AtLat)
2		atllat 40451	. . . . . . . . 9 ⊢ (𝐾 ∈ AtLat → 𝐾 ∈ Lat)
3	2	3ad2ant1 1151	. . . . . . . 8 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → 𝐾 ∈ Lat)
4		atnle.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐾)
5		atnle.a	. . . . . . . . . 10 ⊢ 𝐴 = (Atoms‘𝐾)
6	4, 5	atbase 40440	. . . . . . . . 9 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
7	6	3ad2ant2 1152	. . . . . . . 8 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → 𝑃 ∈ 𝐵)
8		simp3 1156	. . . . . . . 8 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵)
9		atnle.m	. . . . . . . . 9 ⊢ ∧ = (meet‘𝐾)
10	4, 9	latmcl 18620	. . . . . . . 8 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑃 ∧ 𝑋) ∈ 𝐵)
11	3, 7, 8, 10	syl3anc 1398	. . . . . . 7 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝑃 ∧ 𝑋) ∈ 𝐵)
12	11	adantr 486	. . . . . 6 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) ≠ 0 ) → (𝑃 ∧ 𝑋) ∈ 𝐵)
13		simpr 490	. . . . . 6 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) ≠ 0 ) → (𝑃 ∧ 𝑋) ≠ 0 )
14		atnle.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
15		atnle.z	. . . . . . 7 ⊢ 0 = (0.‘𝐾)
16	4, 14, 15, 5	atlex 40467	. . . . . 6 ⊢ ((𝐾 ∈ AtLat ∧ (𝑃 ∧ 𝑋) ∈ 𝐵 ∧ (𝑃 ∧ 𝑋) ≠ 0 ) → ∃𝑦 ∈ 𝐴 𝑦 ≤ (𝑃 ∧ 𝑋))
17	1, 12, 13, 16	syl3anc 1398	. . . . 5 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) ≠ 0 ) → ∃𝑦 ∈ 𝐴 𝑦 ≤ (𝑃 ∧ 𝑋))
18		simpl1 1210	. . . . . . . . . 10 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → 𝐾 ∈ AtLat)
19	18, 2	syl 18	. . . . . . . . 9 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → 𝐾 ∈ Lat)
20	4, 5	atbase 40440	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ 𝐵)
21	20	adantl 487	. . . . . . . . 9 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐵)
22		simpl2 1211	. . . . . . . . . 10 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → 𝑃 ∈ 𝐴)
23	22, 6	syl 18	. . . . . . . . 9 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → 𝑃 ∈ 𝐵)
24		simpl3 1212	. . . . . . . . 9 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → 𝑋 ∈ 𝐵)
25	4, 14, 9	latlem12 18646	. . . . . . . . 9 ⊢ ((𝐾 ∈ Lat ∧ (𝑦 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑦 ≤ 𝑃 ∧ 𝑦 ≤ 𝑋) ↔ 𝑦 ≤ (𝑃 ∧ 𝑋)))
26	19, 21, 23, 24, 25	syl13anc 1399	. . . . . . . 8 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → ((𝑦 ≤ 𝑃 ∧ 𝑦 ≤ 𝑋) ↔ 𝑦 ≤ (𝑃 ∧ 𝑋)))
27		simpr 490	. . . . . . . . . . 11 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐴)
28	14, 5	atcmp 40462	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ AtLat ∧ 𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝐴) → (𝑦 ≤ 𝑃 ↔ 𝑦 = 𝑃))
29	18, 27, 22, 28	syl3anc 1398	. . . . . . . . . 10 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → (𝑦 ≤ 𝑃 ↔ 𝑦 = 𝑃))
30		breq1 5105	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑃 → (𝑦 ≤ 𝑋 ↔ 𝑃 ≤ 𝑋))
31	30	biimpd 232	. . . . . . . . . 10 ⊢ (𝑦 = 𝑃 → (𝑦 ≤ 𝑋 → 𝑃 ≤ 𝑋))
32	29, 31	biimtrdi 256	. . . . . . . . 9 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → (𝑦 ≤ 𝑃 → (𝑦 ≤ 𝑋 → 𝑃 ≤ 𝑋)))
33	32	impd 416	. . . . . . . 8 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → ((𝑦 ≤ 𝑃 ∧ 𝑦 ≤ 𝑋) → 𝑃 ≤ 𝑋))
34	26, 33	sylbird 263	. . . . . . 7 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ 𝑦 ∈ 𝐴) → (𝑦 ≤ (𝑃 ∧ 𝑋) → 𝑃 ≤ 𝑋))
35	34	adantlr 728	. . . . . 6 ⊢ ((((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) ≠ 0 ) ∧ 𝑦 ∈ 𝐴) → (𝑦 ≤ (𝑃 ∧ 𝑋) → 𝑃 ≤ 𝑋))
36	35	rexlimdva 3163	. . . . 5 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) ≠ 0 ) → (∃𝑦 ∈ 𝐴 𝑦 ≤ (𝑃 ∧ 𝑋) → 𝑃 ≤ 𝑋))
37	17, 36	mpd 16	. . . 4 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) ≠ 0 ) → 𝑃 ≤ 𝑋)
38	37	ex 418	. . 3 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ((𝑃 ∧ 𝑋) ≠ 0 → 𝑃 ≤ 𝑋))
39	38	necon1bd 2973	. 2 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (¬ 𝑃 ≤ 𝑋 → (𝑃 ∧ 𝑋) = 0 ))
40	15, 5	atn0 40459	. . . 4 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴) → 𝑃 ≠ 0 )
41	40	3adant3 1150	. . 3 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → 𝑃 ≠ 0 )
42	4, 14, 9	latleeqm1 18647	. . . . . . . 8 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑃 ≤ 𝑋 ↔ (𝑃 ∧ 𝑋) = 𝑃))
43	3, 7, 8, 42	syl3anc 1398	. . . . . . 7 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝑃 ≤ 𝑋 ↔ (𝑃 ∧ 𝑋) = 𝑃))
44	43	adantr 486	. . . . . 6 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≤ 𝑋 ↔ (𝑃 ∧ 𝑋) = 𝑃))
45		eqeq1 2764	. . . . . . . 8 ⊢ ((𝑃 ∧ 𝑋) = 𝑃 → ((𝑃 ∧ 𝑋) = 0 ↔ 𝑃 = 0 ))
46	45	biimpcd 252	. . . . . . 7 ⊢ ((𝑃 ∧ 𝑋) = 0 → ((𝑃 ∧ 𝑋) = 𝑃 → 𝑃 = 0 ))
47	46	adantl 487	. . . . . 6 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → ((𝑃 ∧ 𝑋) = 𝑃 → 𝑃 = 0 ))
48	44, 47	sylbid 243	. . . . 5 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≤ 𝑋 → 𝑃 = 0 ))
49	48	necon3ad 2968	. . . 4 ⊢ (((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≠ 0 → ¬ 𝑃 ≤ 𝑋))
50	49	ex 418	. . 3 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ((𝑃 ∧ 𝑋) = 0 → (𝑃 ≠ 0 → ¬ 𝑃 ≤ 𝑋)))
51	41, 50	mpid 45	. 2 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → ((𝑃 ∧ 𝑋) = 0 → ¬ 𝑃 ≤ 𝑋))
52	39, 51	impbid 215	1 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (¬ 𝑃 ≤ 𝑋 ↔ (𝑃 ∧ 𝑋) = 0 ))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086   class class class wbr 5102  ‘cfv 6539  (class class class)co 7421  Basecbs 17393  lecple 17441  meetcmee 18492  0.cp0 18601  Latclat 18611  Atomscatm 40414  AtLatcal 40415

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-proset 18474  df-poset 18493  df-plt 18508  df-lub 18524  df-glb 18525  df-join 18526  df-meet 18527  df-p0 18603  df-lat 18612  df-covers 40417  df-ats 40418  df-atl 40449

This theorem is used by:  atnem0  40469  iscvlat2N  40475  cvlexch3  40483  cvlexch4N  40484  cvlcvrp  40491  intnatN  40558  cvrat4  40594  dalem24  40848  cdlema2N  40943  llnexchb2lem  41019  lhpmat  41181  cdleme15b  41426  cdlemednpq  41450  cdleme20zN  41452  cdleme22cN  41493  dihmeetlem7N  42461  dihmeetlem17N  42474