![]() |
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 39341 | . . 3 ⊢ (𝐾 ∈ 𝐷 → 𝑁 = {𝑥 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})}) |
6 | 5 | eleq2d 2811 | . 2 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑁 ↔ 𝑋 ∈ {𝑥 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})})) |
7 | 3 | fvexi 6910 | . . . . . . . 8 ⊢ 𝐴 ∈ V |
8 | 7 | rabex 5335 | . . . . . . 7 ⊢ {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} ∈ V |
9 | eleq1 2813 | . . . . . . 7 ⊢ (𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} → (𝑋 ∈ V ↔ {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} ∈ V)) | |
10 | 8, 9 | mpbiri 257 | . . . . . 6 ⊢ (𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} → 𝑋 ∈ V) |
11 | 10 | adantl 480 | . . . . 5 ⊢ ((𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) → 𝑋 ∈ V) |
12 | 11 | a1i 11 | . . . 4 ⊢ ((𝑞 ∈ 𝐴 ∧ 𝑟 ∈ 𝐴) → ((𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) → 𝑋 ∈ V)) |
13 | 12 | rexlimivv 3189 | . . 3 ⊢ (∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) → 𝑋 ∈ V) |
14 | eqeq1 2729 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)} ↔ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})) | |
15 | 14 | anbi2d 628 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝑞 ≠ 𝑟 ∧ 𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) ↔ (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))) |
16 | 15 | 2rexbidv 3209 | . . 3 ⊢ (𝑥 = 𝑋 → (∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}) ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))) |
17 | 13, 16 | elab3 3672 | . 2 ⊢ (𝑋 ∈ {𝑥 ∣ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑥 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})} ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)})) |
18 | 6, 17 | bitrdi 286 | 1 ⊢ (𝐾 ∈ 𝐷 → (𝑋 ∈ 𝑁 ↔ ∃𝑞 ∈ 𝐴 ∃𝑟 ∈ 𝐴 (𝑞 ≠ 𝑟 ∧ 𝑋 = {𝑝 ∈ 𝐴 ∣ 𝑝 ≤ (𝑞 ∨ 𝑟)}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 {cab 2702 ≠ wne 2929 ∃wrex 3059 {crab 3418 Vcvv 3461 class class class wbr 5149 ‘cfv 6549 (class class class)co 7419 lecple 17243 joincjn 18306 Atomscatm 38865 Linesclines 39097 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pr 5429 ax-un 7741 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-ral 3051 df-rex 3060 df-rab 3419 df-v 3463 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4323 df-if 4531 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4910 df-iun 4999 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-iota 6501 df-fun 6551 df-fv 6557 df-ov 7422 df-lines 39104 |
This theorem is referenced by: islinei 39343 linepsubN 39355 isline2 39377 |
Copyright terms: Public domain | W3C validator |