|   | Mathbox for Norm Megill | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > Mathboxes > atcvr0eq | Structured version Visualization version GIF version | ||
| Description: The covers relation is not transitive. (atcv0eq 32399 analog.) (Contributed by NM, 29-Nov-2011.) | 
| Ref | Expression | 
|---|---|
| atcvr0eq.j | ⊢ ∨ = (join‘𝐾) | 
| atcvr0eq.z | ⊢ 0 = (0.‘𝐾) | 
| atcvr0eq.c | ⊢ 𝐶 = ( ⋖ ‘𝐾) | 
| atcvr0eq.a | ⊢ 𝐴 = (Atoms‘𝐾) | 
| Ref | Expression | 
|---|---|
| atcvr0eq | ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ( 0 𝐶(𝑃 ∨ 𝑄) ↔ 𝑃 = 𝑄)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | atcvr0eq.j | . . . . . 6 ⊢ ∨ = (join‘𝐾) | |
| 2 | atcvr0eq.c | . . . . . 6 ⊢ 𝐶 = ( ⋖ ‘𝐾) | |
| 3 | atcvr0eq.a | . . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | 1, 2, 3 | atcvr1 39420 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ≠ 𝑄 ↔ 𝑃𝐶(𝑃 ∨ 𝑄))) | 
| 5 | atcvr0eq.z | . . . . . . . 8 ⊢ 0 = (0.‘𝐾) | |
| 6 | 5, 2, 3 | atcvr0 39290 | . . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴) → 0 𝐶𝑃) | 
| 7 | 6 | 3adant3 1132 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → 0 𝐶𝑃) | 
| 8 | 7 | biantrurd 532 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃𝐶(𝑃 ∨ 𝑄) ↔ ( 0 𝐶𝑃 ∧ 𝑃𝐶(𝑃 ∨ 𝑄)))) | 
| 9 | 4, 8 | bitrd 279 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ≠ 𝑄 ↔ ( 0 𝐶𝑃 ∧ 𝑃𝐶(𝑃 ∨ 𝑄)))) | 
| 10 | simp1 1136 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ HL) | |
| 11 | hlop 39364 | . . . . . . 7 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP) | |
| 12 | 11 | 3ad2ant1 1133 | . . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ OP) | 
| 13 | eqid 2736 | . . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 14 | 13, 5 | op0cl 39186 | . . . . . 6 ⊢ (𝐾 ∈ OP → 0 ∈ (Base‘𝐾)) | 
| 15 | 12, 14 | syl 17 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → 0 ∈ (Base‘𝐾)) | 
| 16 | 13, 3 | atbase 39291 | . . . . . 6 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ (Base‘𝐾)) | 
| 17 | 16 | 3ad2ant2 1134 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → 𝑃 ∈ (Base‘𝐾)) | 
| 18 | 13, 1, 3 | hlatjcl 39369 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ (Base‘𝐾)) | 
| 19 | 13, 2 | cvrntr 39428 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ ( 0 ∈ (Base‘𝐾) ∧ 𝑃 ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑄) ∈ (Base‘𝐾))) → (( 0 𝐶𝑃 ∧ 𝑃𝐶(𝑃 ∨ 𝑄)) → ¬ 0 𝐶(𝑃 ∨ 𝑄))) | 
| 20 | 10, 15, 17, 18, 19 | syl13anc 1373 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (( 0 𝐶𝑃 ∧ 𝑃𝐶(𝑃 ∨ 𝑄)) → ¬ 0 𝐶(𝑃 ∨ 𝑄))) | 
| 21 | 9, 20 | sylbid 240 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ≠ 𝑄 → ¬ 0 𝐶(𝑃 ∨ 𝑄))) | 
| 22 | 21 | necon4ad 2958 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ( 0 𝐶(𝑃 ∨ 𝑄) → 𝑃 = 𝑄)) | 
| 23 | 1, 3 | hlatjidm 39371 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴) → (𝑃 ∨ 𝑃) = 𝑃) | 
| 24 | 23 | 3adant3 1132 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑃) = 𝑃) | 
| 25 | 7, 24 | breqtrrd 5170 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → 0 𝐶(𝑃 ∨ 𝑃)) | 
| 26 | oveq2 7440 | . . . 4 ⊢ (𝑃 = 𝑄 → (𝑃 ∨ 𝑃) = (𝑃 ∨ 𝑄)) | |
| 27 | 26 | breq2d 5154 | . . 3 ⊢ (𝑃 = 𝑄 → ( 0 𝐶(𝑃 ∨ 𝑃) ↔ 0 𝐶(𝑃 ∨ 𝑄))) | 
| 28 | 25, 27 | syl5ibcom 245 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 = 𝑄 → 0 𝐶(𝑃 ∨ 𝑄))) | 
| 29 | 22, 28 | impbid 212 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → ( 0 𝐶(𝑃 ∨ 𝑄) ↔ 𝑃 = 𝑄)) | 
| Colors of variables: wff setvar class | 
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 ≠ wne 2939 class class class wbr 5142 ‘cfv 6560 (class class class)co 7432 Basecbs 17248 joincjn 18358 0.cp0 18469 OPcops 39174 ⋖ ccvr 39264 Atomscatm 39265 HLchlt 39352 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-rep 5278 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-ral 3061 df-rex 3070 df-rmo 3379 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-id 5577 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-riota 7389 df-ov 7435 df-oprab 7436 df-proset 18341 df-poset 18360 df-plt 18376 df-lub 18392 df-glb 18393 df-join 18394 df-meet 18395 df-p0 18471 df-lat 18478 df-clat 18545 df-oposet 39178 df-ol 39180 df-oml 39181 df-covers 39268 df-ats 39269 df-atl 39300 df-cvlat 39324 df-hlat 39353 | 
| This theorem is referenced by: atcvrj0 39431 | 
| Copyright terms: Public domain | W3C validator |