Theorem islinei 35899

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 1201	. . 3 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → 𝑄 ∈ 𝐴)
2		simpl3 1203	. . 3 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → 𝑅 ∈ 𝐴)
3		simpr 479	. . 3 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)}))
4		neeq1 3031	. . . . 5 ⊢ (𝑞 = 𝑄 → (𝑞 ≠ 𝑟 ↔ 𝑄 ≠ 𝑟))
5		oveq1 6931	. . . . . . . 8 ⊢ (𝑞 = 𝑄 → (𝑞 ∨ 𝑟) = (𝑄 ∨ 𝑟))
6	5	breq2d 4900	. . . . . . 7 ⊢ (𝑞 = 𝑄 → (𝑝 ≤ (𝑞 ∨ 𝑟) ↔ 𝑝 ≤ (𝑄 ∨ 𝑟)))
7	6	rabbidv 3386	. . . . . 6 ⊢ (𝑞 = 𝑄 → {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)})
8	7	eqeq2d 2788	. . . . 5 ⊢ (𝑞 = 𝑄 → (𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} ↔ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)}))
9	4, 8	anbi12d 624	. . . 4 ⊢ (𝑞 = 𝑄 → ((𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) ↔ (𝑄 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)})))
10		neeq2 3032	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑄 ≠ 𝑟 ↔ 𝑄 ≠ 𝑅))
11		oveq2 6932	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑄 ∨ 𝑟) = (𝑄 ∨ 𝑅))
12	11	breq2d 4900	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑝 ≤ (𝑄 ∨ 𝑟) ↔ 𝑝 ≤ (𝑄 ∨ 𝑅)))
13	12	rabbidv 3386	. . . . . 6 ⊢ (𝑟 = 𝑅 → {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)} = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})
14	13	eqeq2d 2788	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)} ↔ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)}))
15	10, 14	anbi12d 624	. . . 4 ⊢ (𝑟 = 𝑅 → ((𝑄 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑟)}) ↔ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})))
16	9, 15	rspc2ev 3526	. . 3 ⊢ ((𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴 ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))
17	1, 2, 3, 16	syl3anc 1439	. 2 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))
18		simpl1 1199	. . 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 35898	. . 3 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑁 ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})))
24	18, 23	syl 17	. 2 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → (𝑋 ∈ 𝑁 ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})))
25	17, 24	mpbird 249	1 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑄 ≠ 𝑅 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑄 ∨ 𝑅)})) → 𝑋 ∈ 𝑁)

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386   ∧ w3a 1071   = wceq 1601   ∈ wcel 2107   ≠ wne 2969  ∃wrex 3091  {crab 3094   class class class wbr 4888  ‘cfv 6137  (class class class)co 6924  lecple 16349  joincjn 17334  Atomscatm 35422  Linesclines 35653

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-rep 5008  ax-sep 5019  ax-nul 5027  ax-pr 5140  ax-un 7228

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ne 2970  df-ral 3095  df-rex 3096  df-reu 3097  df-rab 3099  df-v 3400  df-sbc 3653  df-csb 3752  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-nul 4142  df-if 4308  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4674  df-iun 4757  df-br 4889  df-opab 4951  df-mpt 4968  df-id 5263  df-xp 5363  df-rel 5364  df-cnv 5365  df-co 5366  df-dm 5367  df-rn 5368  df-res 5369  df-ima 5370  df-iota 6101  df-fun 6139  df-fn 6140  df-f 6141  df-f1 6142  df-fo 6143  df-f1o 6144  df-fv 6145  df-ov 6927  df-lines 35660

This theorem is referenced by:  linepmap  35934