| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pmtrdifellem3 | Structured version Visualization version GIF version | ||
| Description: Lemma 3 for pmtrdifel 19745. (Contributed by AV, 15-Jan-2019.) |
| Ref | Expression |
|---|---|
| pmtrdifel.t | ⊢ 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾})) |
| pmtrdifel.r | ⊢ 𝑅 = ran (pmTrsp‘𝑁) |
| pmtrdifel.0 | ⊢ 𝑆 = ((pmTrsp‘𝑁)‘dom (𝑄 ∖ I )) |
| Ref | Expression |
|---|---|
| pmtrdifellem3 | ⊢ (𝑄 ∈ 𝑇 → ∀𝑥 ∈ (𝑁 ∖ {𝐾})(𝑄‘𝑥) = (𝑆‘𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pmtrdifel.t | . . . . . . 7 ⊢ 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾})) | |
| 2 | pmtrdifel.r | . . . . . . 7 ⊢ 𝑅 = ran (pmTrsp‘𝑁) | |
| 3 | pmtrdifel.0 | . . . . . . 7 ⊢ 𝑆 = ((pmTrsp‘𝑁)‘dom (𝑄 ∖ I )) | |
| 4 | 1, 2, 3 | pmtrdifellem2 19742 | . . . . . 6 ⊢ (𝑄 ∈ 𝑇 → dom (𝑆 ∖ I ) = dom (𝑄 ∖ I )) |
| 5 | 4 | adantr 486 | . . . . 5 ⊢ ((𝑄 ∈ 𝑇 ∧ 𝑥 ∈ (𝑁 ∖ {𝐾})) → dom (𝑆 ∖ I ) = dom (𝑄 ∖ I )) |
| 6 | 5 | eleq2d 2850 | . . . 4 ⊢ ((𝑄 ∈ 𝑇 ∧ 𝑥 ∈ (𝑁 ∖ {𝐾})) → (𝑥 ∈ dom (𝑆 ∖ I ) ↔ 𝑥 ∈ dom (𝑄 ∖ I ))) |
| 7 | 4 | difeq1d 4065 | . . . . . 6 ⊢ (𝑄 ∈ 𝑇 → (dom (𝑆 ∖ I ) ∖ {𝑥}) = (dom (𝑄 ∖ I ) ∖ {𝑥})) |
| 8 | 7 | unieqd 4885 | . . . . 5 ⊢ (𝑄 ∈ 𝑇 → ∪ (dom (𝑆 ∖ I ) ∖ {𝑥}) = ∪ (dom (𝑄 ∖ I ) ∖ {𝑥})) |
| 9 | 8 | adantr 486 | . . . 4 ⊢ ((𝑄 ∈ 𝑇 ∧ 𝑥 ∈ (𝑁 ∖ {𝐾})) → ∪ (dom (𝑆 ∖ I ) ∖ {𝑥}) = ∪ (dom (𝑄 ∖ I ) ∖ {𝑥})) |
| 10 | 6, 9 | ifbieq1d 4510 | . . 3 ⊢ ((𝑄 ∈ 𝑇 ∧ 𝑥 ∈ (𝑁 ∖ {𝐾})) → if(𝑥 ∈ dom (𝑆 ∖ I ), ∪ (dom (𝑆 ∖ I ) ∖ {𝑥}), 𝑥) = if(𝑥 ∈ dom (𝑄 ∖ I ), ∪ (dom (𝑄 ∖ I ) ∖ {𝑥}), 𝑥)) |
| 11 | 1, 2, 3 | pmtrdifellem1 19741 | . . . 4 ⊢ (𝑄 ∈ 𝑇 → 𝑆 ∈ 𝑅) |
| 12 | eldifi 4070 | . . . 4 ⊢ (𝑥 ∈ (𝑁 ∖ {𝐾}) → 𝑥 ∈ 𝑁) | |
| 13 | eqid 2763 | . . . . 5 ⊢ (pmTrsp‘𝑁) = (pmTrsp‘𝑁) | |
| 14 | eqid 2763 | . . . . 5 ⊢ dom (𝑆 ∖ I ) = dom (𝑆 ∖ I ) | |
| 15 | 13, 2, 14 | pmtrffv 19724 | . . . 4 ⊢ ((𝑆 ∈ 𝑅 ∧ 𝑥 ∈ 𝑁) → (𝑆‘𝑥) = if(𝑥 ∈ dom (𝑆 ∖ I ), ∪ (dom (𝑆 ∖ I ) ∖ {𝑥}), 𝑥)) |
| 16 | 11, 12, 15 | syl2an 608 | . . 3 ⊢ ((𝑄 ∈ 𝑇 ∧ 𝑥 ∈ (𝑁 ∖ {𝐾})) → (𝑆‘𝑥) = if(𝑥 ∈ dom (𝑆 ∖ I ), ∪ (dom (𝑆 ∖ I ) ∖ {𝑥}), 𝑥)) |
| 17 | eqid 2763 | . . . 4 ⊢ (pmTrsp‘(𝑁 ∖ {𝐾})) = (pmTrsp‘(𝑁 ∖ {𝐾})) | |
| 18 | eqid 2763 | . . . 4 ⊢ dom (𝑄 ∖ I ) = dom (𝑄 ∖ I ) | |
| 19 | 17, 1, 18 | pmtrffv 19724 | . . 3 ⊢ ((𝑄 ∈ 𝑇 ∧ 𝑥 ∈ (𝑁 ∖ {𝐾})) → (𝑄‘𝑥) = if(𝑥 ∈ dom (𝑄 ∖ I ), ∪ (dom (𝑄 ∖ I ) ∖ {𝑥}), 𝑥)) |
| 20 | 10, 16, 19 | 3eqtr4rd 2809 | . 2 ⊢ ((𝑄 ∈ 𝑇 ∧ 𝑥 ∈ (𝑁 ∖ {𝐾})) → (𝑄‘𝑥) = (𝑆‘𝑥)) |
| 21 | 20 | ralrimiva 3158 | 1 ⊢ (𝑄 ∈ 𝑇 → ∀𝑥 ∈ (𝑁 ∖ {𝐾})(𝑄‘𝑥) = (𝑆‘𝑥)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ∖ cdif 4048 ifcif 4485 {csn 4588 ∪ cuni 4872 I cid 5552 dom cdm 5658 ran crn 5659 ‘cfv 6566 pmTrspcpmtr 19706 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-om 7912 df-1o 8514 df-2o 8515 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-pmtr 19707 |
| This theorem is used by: pmtrdifel 19745 pmtrdifwrdellem3 19748 |
| Copyright terms: Public domain | W3C validator |