Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > isline | Structured version Visualization version GIF version |
Description: The predicate "is a line". (Contributed by NM, 19-Sep-2011.) |
Ref | Expression |
---|---|
isline.l | ⊢ ≤ = (le‘𝐾) |
isline.j | ⊢ ∨ = (join‘𝐾) |
isline.a | ⊢ 𝐴 = (Atoms‘𝐾) |
isline.n | ⊢ 𝑁 = (Lines‘𝐾) |
Ref | Expression |
---|---|
isline | ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑁 ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isline.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
2 | isline.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
3 | isline.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
4 | isline.n | . . . 4 ⊢ 𝑁 = (Lines‘𝐾) | |
5 | 1, 2, 3, 4 | lineset 35024 | . . 3 ⊢ (𝐾 ∈ 𝐷 → 𝑁 = {𝑥 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})}) |
6 | 5 | eleq2d 2687 | . 2 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑁 ↔ 𝑋 ∈ {𝑥 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})})) |
7 | fvex 6201 | . . . . . . . . 9 ⊢ (Atoms‘𝐾) ∈ V | |
8 | 3, 7 | eqeltri 2697 | . . . . . . . 8 ⊢ 𝐴 ∈ V |
9 | 8 | rabex 4813 | . . . . . . 7 ⊢ {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} ∈ V |
10 | eleq1 2689 | . . . . . . 7 ⊢ (𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} → (𝑋 ∈ V ↔ {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} ∈ V)) | |
11 | 9, 10 | mpbiri 248 | . . . . . 6 ⊢ (𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} → 𝑋 ∈ V) |
12 | 11 | adantl 482 | . . . . 5 ⊢ ((𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) → 𝑋 ∈ V) |
13 | 12 | a1i 11 | . . . 4 ⊢ ((𝑞 ∈ 𝐴 ∧ 𝑟 ∈ 𝐴) → ((𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) → 𝑋 ∈ V)) |
14 | 13 | rexlimivv 3036 | . . 3 ⊢ (∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) → 𝑋 ∈ V) |
15 | eqeq1 2626 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} ↔ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})) | |
16 | 15 | anbi2d 740 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝑞 ≠ 𝑟 ∧ 𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) ↔ (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))) |
17 | 16 | 2rexbidv 3057 | . . 3 ⊢ (𝑥 = 𝑋 → (∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))) |
18 | 14, 17 | elab3 3358 | . 2 ⊢ (𝑋 ∈ {𝑥 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})} ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})) |
19 | 6, 18 | syl6bb 276 | 1 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑁 ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 {cab 2608 ≠ wne 2794 ∃wrex 2913 {crab 2916 Vcvv 3200 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 lecple 15948 joincjn 16944 Atomscatm 34550 Linesclines 34780 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-ov 6653 df-lines 34787 |
This theorem is referenced by: islinei 35026 linepsubN 35038 isline2 35060 |
Copyright terms: Public domain | W3C validator |