llni - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > llni		Structured version Visualization version GIF version

Theorem llni 40672

Description: Condition implying a lattice line. (Contributed by NM, 17-Jun-2012.)

**Hypotheses**
Ref	Expression
llnset.b	⊢ 𝐵 = (Base‘𝐾)
llnset.c	⊢ 𝐶 = ( ⋖ ‘𝐾)
llnset.a	⊢ 𝐴 = (Atoms‘𝐾)
llnset.n	⊢ 𝑁 = (LLines‘𝐾)

**Assertion**
Ref	Expression
llni	⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ 𝑃𝐶𝑋) → 𝑋 ∈ 𝑁)

Proof of Theorem llni Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl2 1211	. 2 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ 𝑃𝐶𝑋) → 𝑋 ∈ 𝐵)
2		breq1 5105	. . . 4 ⊢ (𝑝 = 𝑃 → (𝑝𝐶𝑋 ↔ 𝑃𝐶𝑋))
3	2	rspcev 3576	. . 3 ⊢ ((𝑃 ∈ 𝐴 ∧ 𝑃𝐶𝑋) → ∃𝑝 ∈ 𝐴 𝑝𝐶𝑋)
4	3	3ad2antl3 1206	. 2 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ 𝑃𝐶𝑋) → ∃𝑝 ∈ 𝐴 𝑝𝐶𝑋)
5		simpl1 1210	. . 3 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ 𝑃𝐶𝑋) → 𝐾 ∈ 𝐷)
6		llnset.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
7		llnset.c	. . . 4 ⊢ 𝐶 = ( ⋖ ‘𝐾)
8		llnset.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
9		llnset.n	. . . 4 ⊢ 𝑁 = (LLines‘𝐾)
10	6, 7, 8, 9	islln 40670	. . 3 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑁 ↔ (𝑋 ∈ 𝐵 ∧ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑋)))
11	5, 10	syl 18	. 2 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ 𝑃𝐶𝑋) → (𝑋 ∈ 𝑁 ↔ (𝑋 ∈ 𝐵 ∧ ∃𝑝 ∈ 𝐴 𝑝𝐶𝑋)))
12	1, 4, 11	mpbir2and 726	1 ⊢ (((𝐾 ∈ 𝐷 ∧ 𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴) ∧ 𝑃𝐶𝑋) → 𝑋 ∈ 𝑁)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 class class class wbr 5102 ‘cfv 6541 Basecbs 17394 ⋖ ccvr 40426 Atomscatm 40427 LLinesclln 40655

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-sep 5248 ax-nul 5259 ax-pr 5390

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-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 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-iota 6496 df-fun 6543 df-fv 6549 df-llines 40662

This theorem is used by: llnle 40682 atcvrlln 40684 lplncvrlvol 40780

W3C validator