Theorem islinei 40200

Description: Condition implying "is a line". (Contributed by NM, 3-Feb-2012.)

Hypotheses

Ref	Expression
isline.l	⊢ ≤ = (le‘𝐾)
isline.j	⊢ ∨ = (join‘𝐾)
isline.a	⊢ 𝐴 = (Atoms‘𝐾)
isline.n	⊢ 𝑁 = (Lines‘𝐾)

Assertion

Ref	Expression
islinei	⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → 𝑋 ∈ 𝑁)

Distinct variable groups:   𝐴,𝑝   𝐾,𝑝   𝑄,𝑝   𝑅,𝑝

Allowed substitution hints:   𝐷(𝑝)   ∨ (𝑝)   ≤ (𝑝)   𝑁(𝑝)   𝑋(𝑝)

Proof of Theorem islinei

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

Step	Hyp	Ref	Expression
1		simpl2 1194	. . 3 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → 𝑄 ∈ 𝐴)
2		simpl3 1195	. . 3 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → 𝑅 ∈ 𝐴)
3		simpr 484	. . 3 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)}))
4		neeq1 2995	. . . . 5 ⊢ (𝑞 = 𝑄 → (𝑞 ≠ 𝑟 ↔ 𝑄 ≠ 𝑟))
5		oveq1 7367	. . . . . . . 8 ⊢ (𝑞 = 𝑄 → (𝑞 ∨ 𝑟) = (𝑄 ∨ 𝑟))
6	5	breq2d 5098	. . . . . . 7 ⊢ (𝑞 = 𝑄 → (𝑝 ≤ (𝑞 ∨ 𝑟) ↔ 𝑝 ≤ (𝑄 ∨ 𝑟)))
7	6	rabbidv 3397	. . . . . 6 ⊢ (𝑞 = 𝑄 → {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)})
8	7	eqeq2d 2748	. . . . 5 ⊢ (𝑞 = 𝑄 → (𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} ↔ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)}))
9	4, 8	anbi12d 633	. . . 4 ⊢ (𝑞 = 𝑄 → ((𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) ↔ (𝑄 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)})))
10		neeq2 2996	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑄 ≠ 𝑟 ↔ 𝑄 ≠ 𝑅))
11		oveq2 7368	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑄 ∨ 𝑟) = (𝑄 ∨ 𝑅))
12	11	breq2d 5098	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑝 ≤ (𝑄 ∨ 𝑟) ↔ 𝑝 ≤ (𝑄 ∨ 𝑅)))
13	12	rabbidv 3397	. . . . . 6 ⊢ (𝑟 = 𝑅 → {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)} = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})
14	13	eqeq2d 2748	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)} ↔ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)}))
15	10, 14	anbi12d 633	. . . 4 ⊢ (𝑟 = 𝑅 → ((𝑄 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)}) ↔ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})))
16	9, 15	rspc2ev 3578	. . 3 ⊢ ((𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))
17	1, 2, 3, 16	syl3anc 1374	. 2 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))
18		simpl1 1193	. . 3 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → 𝐾 ∈ 𝐷)
19		isline.l	. . . 4 ⊢ ≤ = (le‘𝐾)
20		isline.j	. . . 4 ⊢ ∨ = (join‘𝐾)
21		isline.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
22		isline.n	. . . 4 ⊢ 𝑁 = (Lines‘𝐾)
23	19, 20, 21, 22	isline 40199	. . 3 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑁 ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})))
24	18, 23	syl 17	. 2 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → (𝑋 ∈ 𝑁 ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})))
25	17, 24	mpbird 257	1 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → 𝑋 ∈ 𝑁)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∃wrex 3062  {crab 3390   class class class wbr 5086  ‘cfv 6492  (class class class)co 7360  lecple 17218  joincjn 18268  Atomscatm 39723  Linesclines 39954

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5370  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7363  df-lines 39961

This theorem is referenced by:  linepmap  40235