| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > trlcocnvat | Structured version Visualization version GIF version | ||
| Description: Commonly used special case of trlcoat 41874. (Contributed by NM, 1-Jul-2013.) |
| Ref | Expression |
|---|---|
| trlcoat.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| trlcoat.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| trlcoat.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| trlcoat.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| trlcocnvat | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘(𝐹 ∘ ◡𝐺)) ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
| 2 | simp2l 1218 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → 𝐹 ∈ 𝑇) | |
| 3 | simp2r 1219 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → 𝐺 ∈ 𝑇) | |
| 4 | trlcoat.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 5 | trlcoat.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 6 | 4, 5 | ltrncnv 41297 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → ◡𝐺 ∈ 𝑇) |
| 7 | 1, 3, 6 | syl2anc 596 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → ◡𝐺 ∈ 𝑇) |
| 8 | simp3 1156 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘𝐹) ≠ (𝑅‘𝐺)) | |
| 9 | trlcoat.r | . . . . 5 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 10 | 4, 5, 9 | trlcnv 41316 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → (𝑅‘◡𝐺) = (𝑅‘𝐺)) |
| 11 | 1, 3, 10 | syl2anc 596 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘◡𝐺) = (𝑅‘𝐺)) |
| 12 | 8, 11 | neeqtrrd 3029 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘𝐹) ≠ (𝑅‘◡𝐺)) |
| 13 | trlcoat.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 14 | 13, 4, 5, 9 | trlcoat 41874 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ ◡𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘◡𝐺)) → (𝑅‘(𝐹 ∘ ◡𝐺)) ∈ 𝐴) |
| 15 | 1, 2, 7, 12, 14 | syl121anc 1402 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘(𝐹 ∘ ◡𝐺)) ∈ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ◡ccnv 5649 ∘ ccom 5654 ‘cfv 6539 Atomscatm 40414 HLchlt 40501 LHypclh 41135 LTrncltrn 41252 trLctrl 41309 |
| 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-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-riotaBAD 40104 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-iin 4953 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-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-1st 8002 df-2nd 8003 df-undef 8294 df-map 8853 df-proset 18474 df-poset 18493 df-plt 18508 df-lub 18524 df-glb 18525 df-join 18526 df-meet 18527 df-p0 18603 df-p1 18604 df-lat 18612 df-clat 18679 df-oposet 40327 df-ol 40329 df-oml 40330 df-covers 40417 df-ats 40418 df-atl 40449 df-cvlat 40473 df-hlat 40502 df-llines 40649 df-lplanes 40650 df-lvols 40651 df-lines 40652 df-psubsp 40654 df-pmap 40655 df-padd 40947 df-lhyp 41139 df-laut 41140 df-ldil 41255 df-ltrn 41256 df-trl 41310 |
| This theorem is used by: cdlemh1 41966 cdlemk3 41984 cdlemk6 41988 cdlemk7 41999 cdlemk12 42001 cdlemkole 42004 cdlemk14 42005 cdlemk15 42006 cdlemk5u 42012 cdlemk6u 42013 cdlemk7u 42021 cdlemk12u 42023 cdlemkfid1N 42072 |
| Copyright terms: Public domain | W3C validator |