| 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 41538. (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 40961 | . . 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 40980 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐺 ∈ 𝑇) → (𝑅‘◡𝐺) = (𝑅‘𝐺)) |
| 11 | 1, 3, 10 | syl2anc 596 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘◡𝐺) = (𝑅‘𝐺)) |
| 12 | 8, 11 | neeqtrrd 3035 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘𝐹) ≠ (𝑅‘◡𝐺)) |
| 13 | trlcoat.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 14 | 13, 4, 5, 9 | trlcoat 41538 | . 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 2146 ≠ wne 2961 ◡ccnv 5665 ∘ ccom 5670 ‘cfv 6543 Atomscatm 40078 HLchlt 40165 LHypclh 40799 LTrncltrn 40916 trLctrl 40973 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-riotaBAD 39768 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-iin 4964 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-1st 7995 df-2nd 7996 df-undef 8278 df-map 8835 df-proset 18375 df-poset 18394 df-plt 18409 df-lub 18425 df-glb 18426 df-join 18427 df-meet 18428 df-p0 18504 df-p1 18505 df-lat 18513 df-clat 18580 df-oposet 39991 df-ol 39993 df-oml 39994 df-covers 40081 df-ats 40082 df-atl 40113 df-cvlat 40137 df-hlat 40166 df-llines 40313 df-lplanes 40314 df-lvols 40315 df-lines 40316 df-psubsp 40318 df-pmap 40319 df-padd 40611 df-lhyp 40803 df-laut 40804 df-ldil 40919 df-ltrn 40920 df-trl 40974 |
| This theorem is used by: cdlemh1 41630 cdlemk3 41648 cdlemk6 41652 cdlemk7 41663 cdlemk12 41665 cdlemkole 41668 cdlemk14 41669 cdlemk15 41670 cdlemk5u 41676 cdlemk6u 41677 cdlemk7u 41685 cdlemk12u 41687 cdlemkfid1N 41736 |
| Copyright terms: Public domain | W3C validator |