| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lssnle | Structured version Visualization version GIF version | ||
| Description: Equivalent expressions for "not less than". (chnlei 31645 analog.) (Contributed by NM, 10-Jan-2015.) (Revised by Mario Carneiro, 19-Apr-2016.) |
| Ref | Expression |
|---|---|
| lssnle.p | ⊢ ⊕ = (LSSum‘𝐺) |
| lssnle.t | ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) |
| lssnle.u | ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) |
| Ref | Expression |
|---|---|
| lssnle | ⊢ (𝜑 → (¬ 𝑈 ⊆ 𝑇 ↔ 𝑇 ⊊ (𝑇 ⊕ 𝑈))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lssnle.t | . . . . 5 ⊢ (𝜑 → 𝑇 ∈ (SubGrp‘𝐺)) | |
| 2 | lssnle.u | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ (SubGrp‘𝐺)) | |
| 3 | lssnle.p | . . . . . 6 ⊢ ⊕ = (LSSum‘𝐺) | |
| 4 | 3 | lsmss2b 19699 | . . . . 5 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → (𝑈 ⊆ 𝑇 ↔ (𝑇 ⊕ 𝑈) = 𝑇)) |
| 5 | 1, 2, 4 | syl2anc 593 | . . . 4 ⊢ (𝜑 → (𝑈 ⊆ 𝑇 ↔ (𝑇 ⊕ 𝑈) = 𝑇)) |
| 6 | eqcom 2768 | . . . 4 ⊢ ((𝑇 ⊕ 𝑈) = 𝑇 ↔ 𝑇 = (𝑇 ⊕ 𝑈)) | |
| 7 | 5, 6 | bitrdi 289 | . . 3 ⊢ (𝜑 → (𝑈 ⊆ 𝑇 ↔ 𝑇 = (𝑇 ⊕ 𝑈))) |
| 8 | 7 | necon3bbid 2993 | . 2 ⊢ (𝜑 → (¬ 𝑈 ⊆ 𝑇 ↔ 𝑇 ≠ (𝑇 ⊕ 𝑈))) |
| 9 | 3 | lsmub1 19688 | . . . 4 ⊢ ((𝑇 ∈ (SubGrp‘𝐺) ∧ 𝑈 ∈ (SubGrp‘𝐺)) → 𝑇 ⊆ (𝑇 ⊕ 𝑈)) |
| 10 | 1, 2, 9 | syl2anc 593 | . . 3 ⊢ (𝜑 → 𝑇 ⊆ (𝑇 ⊕ 𝑈)) |
| 11 | df-pss 3922 | . . . 4 ⊢ (𝑇 ⊊ (𝑇 ⊕ 𝑈) ↔ (𝑇 ⊆ (𝑇 ⊕ 𝑈) ∧ 𝑇 ≠ (𝑇 ⊕ 𝑈))) | |
| 12 | 11 | baib 543 | . . 3 ⊢ (𝑇 ⊆ (𝑇 ⊕ 𝑈) → (𝑇 ⊊ (𝑇 ⊕ 𝑈) ↔ 𝑇 ≠ (𝑇 ⊕ 𝑈))) |
| 13 | 10, 12 | syl 17 | . 2 ⊢ (𝜑 → (𝑇 ⊊ (𝑇 ⊕ 𝑈) ↔ 𝑇 ≠ (𝑇 ⊕ 𝑈))) |
| 14 | 8, 13 | bitr4d 284 | 1 ⊢ (𝜑 → (¬ 𝑈 ⊆ 𝑇 ↔ 𝑇 ⊊ (𝑇 ⊕ 𝑈))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ⊆ wss 3902 ⊊ wpss 3903 ‘cfv 6516 (class class class)co 7391 SubGrpcsubg 19153 LSSumclsm 19665 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-2 12274 df-sets 17191 df-slot 17209 df-ndx 17221 df-base 17237 df-ress 17258 df-plusg 17290 df-0g 17461 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-submnd 18809 df-grp 18969 df-minusg 18970 df-subg 19156 df-lsm 19667 |
| This theorem is referenced by: lrelat 39599 lsmcv2 39614 lcv1 39626 lcv2 39627 |
| Copyright terms: Public domain | W3C validator |