| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lssssr | Structured version Visualization version GIF version | ||
| Description: Conclude subspace ordering from nonzero vector membership. (ssrdv 3937 analog.) (Contributed by NM, 17-Aug-2014.) (Revised by AV, 13-Jul-2022.) |
| Ref | Expression |
|---|---|
| lssssr.o | ⊢ 0 = (0g‘𝑊) |
| lssssr.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| lssssr.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| lssssr.t | ⊢ (𝜑 → 𝑇 ⊆ 𝑉) |
| lssssr.u | ⊢ (𝜑 → 𝑈 ∈ 𝑆) |
| lssssr.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑉 ∖ { 0 })) → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑈)) |
| Ref | Expression |
|---|---|
| lssssr | ⊢ (𝜑 → 𝑇 ⊆ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 0 ) → 𝑥 = 0 ) | |
| 2 | lssssr.w | . . . . . . 7 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 3 | lssssr.u | . . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
| 4 | lssssr.o | . . . . . . . 8 ⊢ 0 = (0g‘𝑊) | |
| 5 | lssssr.s | . . . . . . . 8 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 6 | 4, 5 | lss0cl 21202 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 0 ∈ 𝑈) |
| 7 | 2, 3, 6 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → 0 ∈ 𝑈) |
| 8 | 7 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 0 ) → 0 ∈ 𝑈) |
| 9 | 1, 8 | eqeltrd 2861 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 0 ) → 𝑥 ∈ 𝑈) |
| 10 | 9 | a1d 26 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 0 ) → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑈)) |
| 11 | lssssr.t | . . . . . . 7 ⊢ (𝜑 → 𝑇 ⊆ 𝑉) | |
| 12 | 11 | sseld 3930 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑉)) |
| 13 | 12 | ancrd 561 | . . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑇 → (𝑥 ∈ 𝑉 ∧ 𝑥 ∈ 𝑇))) |
| 14 | 13 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ≠ 0 ) → (𝑥 ∈ 𝑇 → (𝑥 ∈ 𝑉 ∧ 𝑥 ∈ 𝑇))) |
| 15 | eldifsn 4748 | . . . . . . . 8 ⊢ (𝑥 ∈ (𝑉 ∖ { 0 }) ↔ (𝑥 ∈ 𝑉 ∧ 𝑥 ≠ 0 )) | |
| 16 | lssssr.1 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑉 ∖ { 0 })) → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑈)) | |
| 17 | 15, 16 | sylan2br 607 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑥 ≠ 0 )) → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑈)) |
| 18 | 17 | exp32 426 | . . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝑉 → (𝑥 ≠ 0 → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑈)))) |
| 19 | 18 | com23 87 | . . . . 5 ⊢ (𝜑 → (𝑥 ≠ 0 → (𝑥 ∈ 𝑉 → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑈)))) |
| 20 | 19 | imp4b 427 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ≠ 0 ) → ((𝑥 ∈ 𝑉 ∧ 𝑥 ∈ 𝑇) → 𝑥 ∈ 𝑈)) |
| 21 | 14, 20 | syld 48 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ≠ 0 ) → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑈)) |
| 22 | 10, 21 | pm2.61dane 3043 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝑇 → 𝑥 ∈ 𝑈)) |
| 23 | 22 | ssrdv 3937 | 1 ⊢ (𝜑 → 𝑇 ⊆ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∖ cdif 3896 ⊆ wss 3899 {csn 4584 ‘cfv 6531 0gc0g 17590 LModclmod 21115 LSubSpclss 21186 |
| 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-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| 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-nel 3063 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-pss 3919 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-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 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-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 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-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-nn 12317 df-2 12386 df-sets 17322 df-slot 17340 df-ndx 17352 df-base 17368 df-plusg 17421 df-0g 17592 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-grp 19127 df-minusg 19128 df-sbg 19129 df-mgp 20341 df-ur 20388 df-ring 20441 df-lmod 21117 df-lss 21187 |
| This theorem is used by: dihjat1lem 42453 |
| Copyright terms: Public domain | W3C validator |