Theorem lnatexN 39766

Description: There is an atom in a line different from any other. (Contributed by NM, 30-Apr-2012.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lnatex.b	⊢ 𝐵 = (Base‘𝐾)
lnatex.l	⊢ ≤ = (le‘𝐾)
lnatex.a	⊢ 𝐴 = (Atoms‘𝐾)
lnatex.n	⊢ 𝑁 = (Lines‘𝐾)
lnatex.m	⊢ 𝑀 = (pmap‘𝐾)

Assertion

Ref	Expression
lnatexN	⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) → ∃𝑞 ∈ 𝐴 (𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋))

Distinct variable groups:   𝐴,𝑞   ≤ ,𝑞   𝑃,𝑞   𝑋,𝑞

Allowed substitution hints:   𝐵(𝑞)   𝐾(𝑞)   𝑀(𝑞)   𝑁(𝑞)

Proof of Theorem lnatexN

Dummy variables 𝑟 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lnatex.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		eqid 2729	. . . 4 ⊢ (join‘𝐾) = (join‘𝐾)
3		lnatex.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
4		lnatex.n	. . . 4 ⊢ 𝑁 = (Lines‘𝐾)
5		lnatex.m	. . . 4 ⊢ 𝑀 = (pmap‘𝐾)
6	1, 2, 3, 4, 5	isline3 39763	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((𝑀‘𝑋) ∈ 𝑁 ↔ ∃𝑟 ∈ 𝐴 ∃𝑠 ∈ 𝐴 (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))))
7	6	biimp3a 1471	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) → ∃𝑟 ∈ 𝐴 ∃𝑠 ∈ 𝐴 (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠)))
8		simpl2r 1228	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → 𝑠 ∈ 𝐴)
9		simpl3l 1229	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → 𝑟 ≠ 𝑠)
10	9	necomd 2980	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → 𝑠 ≠ 𝑟)
11		simpr 484	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → 𝑟 = 𝑃)
12	10, 11	neeqtrd 2994	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → 𝑠 ≠ 𝑃)
13		simpl11 1249	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → 𝐾 ∈ HL)
14		simpl2l 1227	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → 𝑟 ∈ 𝐴)
15		lnatex.l	. . . . . . . . 9 ⊢ ≤ = (le‘𝐾)
16	15, 2, 3	hlatlej2 39362	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) → 𝑠 ≤ (𝑟(join‘𝐾)𝑠))
17	13, 14, 8, 16	syl3anc 1373	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → 𝑠 ≤ (𝑟(join‘𝐾)𝑠))
18		simpl3r 1230	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → 𝑋 = (𝑟(join‘𝐾)𝑠))
19	17, 18	breqtrrd 5130	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → 𝑠 ≤ 𝑋)
20		neeq1 2987	. . . . . . . 8 ⊢ (𝑞 = 𝑠 → (𝑞 ≠ 𝑃 ↔ 𝑠 ≠ 𝑃))
21		breq1 5105	. . . . . . . 8 ⊢ (𝑞 = 𝑠 → (𝑞 ≤ 𝑋 ↔ 𝑠 ≤ 𝑋))
22	20, 21	anbi12d 632	. . . . . . 7 ⊢ (𝑞 = 𝑠 → ((𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋) ↔ (𝑠 ≠ 𝑃 ∧ 𝑠 ≤ 𝑋)))
23	22	rspcev 3585	. . . . . 6 ⊢ ((𝑠 ∈ 𝐴 ∧ (𝑠 ≠ 𝑃 ∧ 𝑠 ≤ 𝑋)) → ∃𝑞 ∈ 𝐴 (𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋))
24	8, 12, 19, 23	syl12anc 836	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 = 𝑃) → ∃𝑞 ∈ 𝐴 (𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋))
25		simpl2l 1227	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 ≠ 𝑃) → 𝑟 ∈ 𝐴)
26		simpr 484	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 ≠ 𝑃) → 𝑟 ≠ 𝑃)
27		simpl11 1249	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 ≠ 𝑃) → 𝐾 ∈ HL)
28		simpl2r 1228	. . . . . . . 8 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 ≠ 𝑃) → 𝑠 ∈ 𝐴)
29	15, 2, 3	hlatlej1 39361	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) → 𝑟 ≤ (𝑟(join‘𝐾)𝑠))
30	27, 25, 28, 29	syl3anc 1373	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 ≠ 𝑃) → 𝑟 ≤ (𝑟(join‘𝐾)𝑠))
31		simpl3r 1230	. . . . . . 7 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 ≠ 𝑃) → 𝑋 = (𝑟(join‘𝐾)𝑠))
32	30, 31	breqtrrd 5130	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 ≠ 𝑃) → 𝑟 ≤ 𝑋)
33		neeq1 2987	. . . . . . . 8 ⊢ (𝑞 = 𝑟 → (𝑞 ≠ 𝑃 ↔ 𝑟 ≠ 𝑃))
34		breq1 5105	. . . . . . . 8 ⊢ (𝑞 = 𝑟 → (𝑞 ≤ 𝑋 ↔ 𝑟 ≤ 𝑋))
35	33, 34	anbi12d 632	. . . . . . 7 ⊢ (𝑞 = 𝑟 → ((𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋) ↔ (𝑟 ≠ 𝑃 ∧ 𝑟 ≤ 𝑋)))
36	35	rspcev 3585	. . . . . 6 ⊢ ((𝑟 ∈ 𝐴 ∧ (𝑟 ≠ 𝑃 ∧ 𝑟 ≤ 𝑋)) → ∃𝑞 ∈ 𝐴 (𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋))
37	25, 26, 32, 36	syl12anc 836	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) ∧ 𝑟 ≠ 𝑃) → ∃𝑞 ∈ 𝐴 (𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋))
38	24, 37	pm2.61dane 3012	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) ∧ (𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) ∧ (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠))) → ∃𝑞 ∈ 𝐴 (𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋))
39	38	3exp 1119	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) → ((𝑟 ∈ 𝐴 ∧ 𝑠 ∈ 𝐴) → ((𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠)) → ∃𝑞 ∈ 𝐴 (𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋))))
40	39	rexlimdvv 3191	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) → (∃𝑟 ∈ 𝐴 ∃𝑠 ∈ 𝐴 (𝑟 ≠ 𝑠 ∧ 𝑋 = (𝑟(join‘𝐾)𝑠)) → ∃𝑞 ∈ 𝐴 (𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋)))
41	7, 40	mpd 15	1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ (𝑀‘𝑋) ∈ 𝑁) → ∃𝑞 ∈ 𝐴 (𝑞 ≠ 𝑃 ∧ 𝑞 ≤ 𝑋))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∃wrex 3053   class class class wbr 5102  ‘cfv 6499  (class class class)co 7369  Basecbs 17155  lecple 17203  joincjn 18252  Atomscatm 39249  HLchlt 39336  Linesclines 39481  pmapcpmap 39484

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7326  df-ov 7372  df-oprab 7373  df-proset 18235  df-poset 18254  df-plt 18269  df-lub 18285  df-glb 18286  df-join 18287  df-meet 18288  df-p0 18364  df-lat 18373  df-clat 18440  df-oposet 39162  df-ol 39164  df-oml 39165  df-covers 39252  df-ats 39253  df-atl 39284  df-cvlat 39308  df-hlat 39337  df-lines 39488  df-pmap 39491

This theorem is referenced by:  lnjatN  39767