| 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 19447. (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 2739 | . . 3 ⊢ (pmTrsp‘(𝑁 ∖ {𝐾})) = (pmTrsp‘(𝑁 ∖ {𝐾})) | |
| 2 | pmtrdifel.t | . . 3 ⊢ 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾})) | |
| 3 | 1, 2 | pmtrfb 19432 | . 2 ⊢ (𝑄 ∈ 𝑇 ↔ ((𝑁 ∖ {𝐾}) ∈ V ∧ 𝑄:(𝑁 ∖ {𝐾})–1-1-onto→(𝑁 ∖ {𝐾}) ∧ dom (𝑄 ∖ I ) ≈ 2o)) |
| 4 | difsnexi 7705 | . . 3 ⊢ ((𝑁 ∖ {𝐾}) ∈ V → 𝑁 ∈ V) | |
| 5 | f1of 6768 | . . . 4 ⊢ (𝑄:(𝑁 ∖ {𝐾})–1-1-onto→(𝑁 ∖ {𝐾}) → 𝑄:(𝑁 ∖ {𝐾})⟶(𝑁 ∖ {𝐾})) | |
| 6 | fdm 6665 | . . . 4 ⊢ (𝑄:(𝑁 ∖ {𝐾})⟶(𝑁 ∖ {𝐾}) → dom 𝑄 = (𝑁 ∖ {𝐾})) | |
| 7 | difssd 4068 | . . . . . 6 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → (𝑄 ∖ I ) ⊆ 𝑄) | |
| 8 | dmss 5845 | . . . . . 6 ⊢ ((𝑄 ∖ I ) ⊆ 𝑄 → dom (𝑄 ∖ I ) ⊆ dom 𝑄) | |
| 9 | 7, 8 | syl 17 | . . . . 5 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → dom (𝑄 ∖ I ) ⊆ dom 𝑄) |
| 10 | difssd 4068 | . . . . . 6 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → (𝑁 ∖ {𝐾}) ⊆ 𝑁) | |
| 11 | sseq1 3940 | . . . . . 6 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → (dom 𝑄 ⊆ 𝑁 ↔ (𝑁 ∖ {𝐾}) ⊆ 𝑁)) | |
| 12 | 10, 11 | mpbird 258 | . . . . 5 ⊢ (dom 𝑄 = (𝑁 ∖ {𝐾}) → dom 𝑄 ⊆ 𝑁) |
| 13 | 9, 12 | sstrd 3925 | . . . 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 2739 | . . . . 5 ⊢ (pmTrsp‘𝑁) = (pmTrsp‘𝑁) | |
| 18 | pmtrdifel.r | . . . . 5 ⊢ 𝑅 = ran (pmTrsp‘𝑁) | |
| 19 | 17, 18 | pmtrrn 19424 | . . . 4 ⊢ ((𝑁 ∈ V ∧ dom (𝑄 ∖ I ) ⊆ 𝑁 ∧ dom (𝑄 ∖ I ) ≈ 2o) → ((pmTrsp‘𝑁)‘dom (𝑄 ∖ I )) ∈ 𝑅) |
| 20 | 16, 19 | eqeltrid 2843 | . . 3 ⊢ ((𝑁 ∈ V ∧ dom (𝑄 ∖ I ) ⊆ 𝑁 ∧ dom (𝑄 ∖ I ) ≈ 2o) → 𝑆 ∈ 𝑅) |
| 21 | 4, 14, 15, 20 | syl3an 1166 | . 2 ⊢ (((𝑁 ∖ {𝐾}) ∈ V ∧ 𝑄:(𝑁 ∖ {𝐾})–1-1-onto→(𝑁 ∖ {𝐾}) ∧ dom (𝑄 ∖ I ) ≈ 2o) → 𝑆 ∈ 𝑅) |
| 22 | 3, 21 | sylbi 218 | 1 ⊢ (𝑄 ∈ 𝑇 → 𝑆 ∈ 𝑅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 Vcvv 3431 ∖ cdif 3880 ⊆ wss 3883 {csn 4556 class class class wbr 5073 I cid 5513 dom cdm 5619 ran crn 5620 ⟶wf 6482 –1-1-onto→wf1o 6485 ‘cfv 6486 2oc2o 8390 ≈ cen 8881 pmTrspcpmtr 19408 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5200 ax-sep 5219 ax-nul 5229 ax-pow 5295 ax-pr 5363 ax-un 7679 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4263 df-if 4456 df-pw 4532 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-iun 4924 df-br 5074 df-opab 5136 df-mpt 5155 df-tr 5181 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-om 7808 df-1o 8396 df-2o 8397 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-pmtr 19409 |
| This theorem is referenced by: pmtrdifellem3 19445 pmtrdifellem4 19446 pmtrdifel 19447 pmtrdifwrdellem1 19448 pmtrdifwrdellem2 19449 |
| Copyright terms: Public domain | W3C validator |