| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pmtrdifellem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for pmtrdifel 19521. (Contributed by AV, 15-Jan-2019.) |
| Ref | Expression |
|---|---|
| pmtrdifel.t | ⊢ 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾})) |
| pmtrdifel.r | ⊢ 𝑅 = ran (pmTrsp‘𝑁) |
| pmtrdifel.0 | ⊢ 𝑆 = ((pmTrsp‘𝑁)‘dom (𝑄 ∖ I )) |
| Ref | Expression |
|---|---|
| pmtrdifellem1 | ⊢ (𝑄 ∈ 𝑇 → 𝑆 ∈ 𝑅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . 3 ⊢ (pmTrsp‘(𝑁 ∖ {𝐾})) = (pmTrsp‘(𝑁 ∖ {𝐾})) | |
| 2 | pmtrdifel.t | . . 3 ⊢ 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾})) | |
| 3 | 1, 2 | pmtrfb 19506 | . 2 ⊢ (𝑄 ∈ 𝑇 ↔ ((𝑁 ∖ {𝐾}) ∈ V ∧ 𝑄:(𝑁 ∖ {𝐾})–1-1-onto→(𝑁 ∖ {𝐾}) ∧ dom (𝑄 ∖ I ) ≈ 2o)) |
| 4 | difsnexi 7745 | . . 3 ⊢ ((𝑁 ∖ {𝐾}) ∈ V → 𝑁 ∈ V) | |
| 5 | f1of 6807 | . . . 4 ⊢ (𝑄:(𝑁 ∖ {𝐾})–1-1-onto→(𝑁 ∖ {𝐾}) → 𝑄:(𝑁 ∖ {𝐾})⟶(𝑁 ∖ {𝐾})) | |
| 6 | fdm 6702 | . . . 4 ⊢ (𝑄:(𝑁 ∖ {𝐾})⟶(𝑁 ∖ {𝐾}) → dom 𝑄 = (𝑁 ∖ {𝐾})) | |
| 7 | difssd 4091 | . . . . . 6 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → (𝑄 ∖ I ) ⊆ 𝑄) | |
| 8 | dmss 5879 | . . . . . 6 ⊢ ((𝑄 ∖ I ) ⊆ 𝑄 → dom (𝑄 ∖ I ) ⊆ dom 𝑄) | |
| 9 | 7, 8 | syl 17 | . . . . 5 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → dom (𝑄 ∖ I ) ⊆ dom 𝑄) |
| 10 | difssd 4091 | . . . . . 6 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → (𝑁 ∖ {𝐾}) ⊆ 𝑁) | |
| 11 | sseq1 3962 | . . . . . 6 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → (dom 𝑄 ⊆ 𝑁 ↔ (𝑁 ∖ {𝐾}) ⊆ 𝑁)) | |
| 12 | 10, 11 | mpbird 259 | . . . . 5 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → dom 𝑄 ⊆ 𝑁) |
| 13 | 9, 12 | sstrd 3947 | . . . 4 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → dom (𝑄 ∖ I ) ⊆ 𝑁) |
| 14 | 5, 6, 13 | 3syl 18 | . . 3 ⊢ (𝑄:(𝑁 ∖ {𝐾})–1-1-onto→(𝑁 ∖ {𝐾}) → dom (𝑄 ∖ I ) ⊆ 𝑁) |
| 15 | id 22 | . . 3 ⊢ (dom (𝑄 ∖ I ) ≈ 2o → dom (𝑄 ∖ I ) ≈ 2o) | |
| 16 | pmtrdifel.0 | . . . 4 ⊢ 𝑆 = ((pmTrsp‘𝑁)‘dom (𝑄 ∖ I )) | |
| 17 | eqid 2763 | . . . . 5 ⊢ (pmTrsp‘𝑁) = (pmTrsp‘𝑁) | |
| 18 | pmtrdifel.r | . . . . 5 ⊢ 𝑅 = ran (pmTrsp‘𝑁) | |
| 19 | 17, 18 | pmtrrn 19498 | . . . 4 ⊢ ((𝑁 ∈ V ∧ dom (𝑄 ∖ I ) ⊆ 𝑁 ∧ dom (𝑄 ∖ I ) ≈ 2o) → ((pmTrsp‘𝑁)‘dom (𝑄 ∖ I )) ∈ 𝑅) |
| 20 | 16, 19 | eqeltrid 2867 | . . 3 ⊢ ((𝑁 ∈ V ∧ dom (𝑄 ∖ I ) ⊆ 𝑁 ∧ dom (𝑄 ∖ I ) ≈ 2o) → 𝑆 ∈ 𝑅) |
| 21 | 4, 14, 15, 20 | syl3an 1174 | . 2 ⊢ (((𝑁 ∖ {𝐾}) ∈ V ∧ 𝑄:(𝑁 ∖ {𝐾})–1-1-onto→(𝑁 ∖ {𝐾}) ∧ dom (𝑄 ∖ I ) ≈ 2o) → 𝑆 ∈ 𝑅) |
| 22 | 3, 21 | sylbi 219 | 1 ⊢ (𝑄 ∈ 𝑇 → 𝑆 ∈ 𝑅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1099 = wceq 1561 ∈ wcel 2143 Vcvv 3455 ∖ cdif 3902 ⊆ wss 3905 {csn 4583 class class class wbr 5101 I cid 5542 dom cdm 5648 ran crn 5649 ⟶wf 6518 –1-1-onto→wf1o 6521 ‘cfv 6522 2oc2o 8432 ≈ cen 8925 pmTrspcpmtr 19482 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3078 df-rex 3088 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-ord 6350 df-on 6351 df-lim 6352 df-suc 6353 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-om 7848 df-1o 8438 df-2o 8439 df-er 8679 df-en 8929 df-dom 8930 df-sdom 8931 df-fin 8932 df-pmtr 19483 |
| This theorem is referenced by: pmtrdifellem3 19519 pmtrdifellem4 19520 pmtrdifel 19521 pmtrdifwrdellem1 19522 pmtrdifwrdellem2 19523 |
| Copyright terms: Public domain | W3C validator |