| 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 41748. (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 41171 | . . 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 41190 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → (𝑅‘◡𝐺) = (𝑅‘𝐺)) |
| 11 | 1, 3, 10 | syl2anc 596 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘◡𝐺) = (𝑅‘𝐺)) |
| 12 | 8, 11 | neeqtrrd 3030 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘𝐹) ≠ (𝑅‘◡𝐺)) |
| 13 | trlcoat.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 14 | 13, 4, 5, 9 | trlcoat 41748 | . 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 1570 ∈ wcel 2145 ≠ wne 2956 ◡ccnv 5650 ∘ ccom 5655 ‘cfv 6531 Atomscatm 40288 HLchlt 40375 LHypclh 41009 LTrncltrn 41126 trLctrl 41183 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-riotaBAD 39978 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7990 df-2nd 7991 df-undef 8274 df-map 8833 df-proset 18448 df-poset 18467 df-plt 18482 df-lub 18498 df-glb 18499 df-join 18500 df-meet 18501 df-p0 18577 df-p1 18578 df-lat 18586 df-clat 18653 df-oposet 40201 df-ol 40203 df-oml 40204 df-covers 40291 df-ats 40292 df-atl 40323 df-cvlat 40347 df-hlat 40376 df-llines 40523 df-lplanes 40524 df-lvols 40525 df-lines 40526 df-psubsp 40528 df-pmap 40529 df-padd 40821 df-lhyp 41013 df-laut 41014 df-ldil 41129 df-ltrn 41130 df-trl 41184 |
| This theorem is used by: cdlemh1 41840 cdlemk3 41858 cdlemk6 41862 cdlemk7 41873 cdlemk12 41875 cdlemkole 41878 cdlemk14 41879 cdlemk15 41880 cdlemk5u 41886 cdlemk6u 41887 cdlemk7u 41895 cdlemk12u 41897 cdlemkfid1N 41946 |
| Copyright terms: Public domain | W3C validator |