islpln5 - Mathbox for Norm Megill

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

Theorem islpln5 36831

Description: The predicate "is a lattice plane" in terms of atoms. (Contributed by NM, 24-Jun-2012.)

**Hypotheses**
Ref	Expression
islpln5.b	⊢ 𝐵 = (Base‘𝐾)
islpln5.l	⊢ ≤ = (le‘𝐾)
islpln5.j	⊢ ∨ = (join‘𝐾)
islpln5.a	⊢ 𝐴 = (Atoms‘𝐾)
islpln5.p	⊢ 𝑃 = (LPlanes‘𝐾)

**Assertion**
Ref	Expression
islpln5	⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑃 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))

Distinct variable groups: 𝑞,𝑝,𝑟,𝐴 𝐵,𝑝,𝑞,𝑟 ∨ ,𝑝,𝑞,𝑟 𝐾,𝑝,𝑞,𝑟 ≤ ,𝑝,𝑞,𝑟 𝑋,𝑝,𝑞,𝑟 Allowed substitution hints: 𝑃(𝑟,𝑞,𝑝)

Proof of Theorem islpln5 Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		islpln5.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		islpln5.l	. . 3 ⊢ ≤ = (le‘𝐾)
3		islpln5.j	. . 3 ⊢ ∨ = (join‘𝐾)
4		islpln5.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
5		eqid 2798	. . 3 ⊢ (LLines‘𝐾) = (LLines‘𝐾)
6		islpln5.p	. . 3 ⊢ 𝑃 = (LPlanes‘𝐾)
7	1, 2, 3, 4, 5, 6	islpln3 36829	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑃 ↔ ∃𝑦 ∈ (LLines‘𝐾)∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))))
8		df-rex 3112	. . 3 ⊢ (∃𝑦 ∈ (LLines‘𝐾)∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)) ↔ ∃𝑦(𝑦 ∈ (LLines‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))))
9		r19.41v 3300	. . . . . . . . . 10 ⊢ (∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ (∃𝑟 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
10		an13 646	. . . . . . . . . 10 ⊢ ((∃𝑟 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ (𝑦 = (𝑝 ∨ 𝑞) ∧ (𝑝 ≠ 𝑞 ∧ ∃𝑟 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))))))
11	9, 10	bitri 278	. . . . . . . . 9 ⊢ (∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ (𝑦 = (𝑝 ∨ 𝑞) ∧ (𝑝 ≠ 𝑞 ∧ ∃𝑟 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))))))
12	11	exbii 1849	. . . . . . . 8 ⊢ (∃𝑦∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑦(𝑦 = (𝑝 ∨ 𝑞) ∧ (𝑝 ≠ 𝑞 ∧ ∃𝑟 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))))))
13		ovex 7168	. . . . . . . . 9 ⊢ (𝑝 ∨ 𝑞) ∈ V
14		an12 644	. . . . . . . . . . . 12 ⊢ ((𝑝 ≠ 𝑞 ∧ (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))) ↔ (𝑦 ∈ 𝐵 ∧ (𝑝 ≠ 𝑞 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))))
15		eleq1 2877	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → (𝑦 ∈ 𝐵 ↔ (𝑝 ∨ 𝑞) ∈ 𝐵))
16		breq2 5034	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → (𝑟 ≤ 𝑦 ↔ 𝑟 ≤ (𝑝 ∨ 𝑞)))
17	16	notbid 321	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → (¬ 𝑟 ≤ 𝑦 ↔ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞)))
18		oveq1 7142	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → (𝑦 ∨ 𝑟) = ((𝑝 ∨ 𝑞) ∨ 𝑟))
19	18	eqeq2d 2809	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → (𝑋 = (𝑦 ∨ 𝑟) ↔ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)))
20	17, 19	anbi12d 633	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → ((¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)) ↔ (¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))
21	20	anbi2d 631	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → ((𝑝 ≠ 𝑞 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ↔ (𝑝 ≠ 𝑞 ∧ (¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)))))
22		3anass 1092	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)) ↔ (𝑝 ≠ 𝑞 ∧ (¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))
23	21, 22	syl6bbr 292	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → ((𝑝 ≠ 𝑞 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ↔ (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))
24	15, 23	anbi12d 633	. . . . . . . . . . . 12 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → ((𝑦 ∈ 𝐵 ∧ (𝑝 ≠ 𝑞 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))) ↔ ((𝑝 ∨ 𝑞) ∈ 𝐵 ∧ (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)))))
25	14, 24	syl5bb 286	. . . . . . . . . . 11 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → ((𝑝 ≠ 𝑞 ∧ (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))) ↔ ((𝑝 ∨ 𝑞) ∈ 𝐵 ∧ (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)))))
26	25	rexbidv 3256	. . . . . . . . . 10 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → (∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))) ↔ ∃𝑟 ∈ 𝐴 ((𝑝 ∨ 𝑞) ∈ 𝐵 ∧ (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)))))
27		r19.42v 3303	. . . . . . . . . 10 ⊢ (∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))) ↔ (𝑝 ≠ 𝑞 ∧ ∃𝑟 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))))
28		r19.42v 3303	. . . . . . . . . 10 ⊢ (∃𝑟 ∈ 𝐴 ((𝑝 ∨ 𝑞) ∈ 𝐵 ∧ (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))) ↔ ((𝑝 ∨ 𝑞) ∈ 𝐵 ∧ ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))
29	26, 27, 28	3bitr3g 316	. . . . . . . . 9 ⊢ (𝑦 = (𝑝 ∨ 𝑞) → ((𝑝 ≠ 𝑞 ∧ ∃𝑟 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))) ↔ ((𝑝 ∨ 𝑞) ∈ 𝐵 ∧ ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)))))
30	13, 29	ceqsexv 3489	. . . . . . . 8 ⊢ (∃𝑦(𝑦 = (𝑝 ∨ 𝑞) ∧ (𝑝 ≠ 𝑞 ∧ ∃𝑟 ∈ 𝐴 (𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))))) ↔ ((𝑝 ∨ 𝑞) ∈ 𝐵 ∧ ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))
31	12, 30	bitri 278	. . . . . . 7 ⊢ (∃𝑦∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ((𝑝 ∨ 𝑞) ∈ 𝐵 ∧ ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))
32		simpll 766	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → 𝐾 ∈ HL)
33		simprl 770	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → 𝑝 ∈ 𝐴)
34		simprr 772	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → 𝑞 ∈ 𝐴)
35	1, 3, 4	hlatjcl 36663	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴) → (𝑝 ∨ 𝑞) ∈ 𝐵)
36	32, 33, 34, 35	syl3anc 1368	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (𝑝 ∨ 𝑞) ∈ 𝐵)
37	36	biantrurd 536	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)) ↔ ((𝑝 ∨ 𝑞) ∈ 𝐵 ∧ ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)))))
38	31, 37	bitr4id 293	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ 𝐴 ∧ 𝑞 ∈ 𝐴)) → (∃𝑦∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))
39	38	2rexbidva 3258	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑦∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))
40		rexcom4 3212	. . . . . . 7 ⊢ (∃𝑞 ∈ 𝐴 ∃𝑦∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑦∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
41	40	rexbii 3210	. . . . . 6 ⊢ (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑦∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑝 ∈ 𝐴 ∃𝑦∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
42		rexcom4 3212	. . . . . 6 ⊢ (∃𝑝 ∈ 𝐴 ∃𝑦∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑦∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
43	41, 42	bitri 278	. . . . 5 ⊢ (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑦∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑦∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
44	39, 43	bitr3di 289	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)) ↔ ∃𝑦∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞)))))
45		rexcom 3308	. . . . . . . . 9 ⊢ (∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑟 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
46	45	rexbii 3210	. . . . . . . 8 ⊢ (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑝 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
47		rexcom 3308	. . . . . . . 8 ⊢ (∃𝑝 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑟 ∈ 𝐴 ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
48	46, 47	bitri 278	. . . . . . 7 ⊢ (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑟 ∈ 𝐴 ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
49	1, 3, 4, 5	islln2 36807	. . . . . . . . . . 11 ⊢ (𝐾 ∈ HL → (𝑦 ∈ (LLines‘𝐾) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞)))))
50	49	adantr 484	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑦 ∈ (LLines‘𝐾) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞)))))
51	50	anbi1d 632	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((𝑦 ∈ (LLines‘𝐾) ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ↔ ((𝑦 ∈ 𝐵 ∧ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))))
52		r19.42v 3303	. . . . . . . . . 10 ⊢ (∃𝑝 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
53		r19.42v 3303	. . . . . . . . . . 11 ⊢ (∃𝑞 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
54	53	rexbii 3210	. . . . . . . . . 10 ⊢ (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑝 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
55		an32 645	. . . . . . . . . 10 ⊢ (((𝑦 ∈ 𝐵 ∧ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ↔ ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
56	52, 54, 55	3bitr4ri 307	. . . . . . . . 9 ⊢ (((𝑦 ∈ 𝐵 ∧ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))))
57	51, 56	syl6bb 290	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → ((𝑦 ∈ (LLines‘𝐾) ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞)))))
58	57	rexbidv 3256	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (∃𝑟 ∈ 𝐴 (𝑦 ∈ (LLines‘𝐾) ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ↔ ∃𝑟 ∈ 𝐴 ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞)))))
59	48, 58	bitr4id 293	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑟 ∈ 𝐴 (𝑦 ∈ (LLines‘𝐾) ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))))
60		r19.42v 3303	. . . . . 6 ⊢ (∃𝑟 ∈ 𝐴 (𝑦 ∈ (LLines‘𝐾) ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ↔ (𝑦 ∈ (LLines‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))))
61	59, 60	syl6bb 290	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ (𝑦 ∈ (LLines‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))))
62	61	exbidv 1922	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (∃𝑦∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 ((𝑦 ∈ 𝐵 ∧ (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟))) ∧ (𝑝 ≠ 𝑞 ∧ 𝑦 = (𝑝 ∨ 𝑞))) ↔ ∃𝑦(𝑦 ∈ (LLines‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))))
63	44, 62	bitrd 282	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟)) ↔ ∃𝑦(𝑦 ∈ (LLines‘𝐾) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)))))
64	8, 63	bitr4id 293	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (∃𝑦 ∈ (LLines‘𝐾)∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑦 ∧ 𝑋 = (𝑦 ∨ 𝑟)) ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))
65	7, 64	bitrd 282	1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑋 ∈ 𝑃 ↔ ∃𝑝 ∈ 𝐴 ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑝 ≠ 𝑞 ∧ ¬ 𝑟 ≤ (𝑝 ∨ 𝑞) ∧ 𝑋 = ((𝑝 ∨ 𝑞) ∨ 𝑟))))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∃wex 1781 ∈ wcel 2111 ≠ wne 2987 ∃wrex 3107 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 lecple 16564 joincjn 17546 Atomscatm 36559 HLchlt 36646 LLinesclln 36787 LPlanesclpl 36788

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-proset 17530 df-poset 17548 df-plt 17560 df-lub 17576 df-glb 17577 df-join 17578 df-meet 17579 df-p0 17641 df-lat 17648 df-clat 17710 df-oposet 36472 df-ol 36474 df-oml 36475 df-covers 36562 df-ats 36563 df-atl 36594 df-cvlat 36618 df-hlat 36647 df-llines 36794 df-lplanes 36795

This theorem is referenced by: islpln2 36832 lplni2 36833

W3C validator