| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ressbas | Structured version Visualization version GIF version | ||
| Description: Base set of a structure restriction. (Contributed by Stefan O'Rear, 26-Nov-2014.) (Proof shortened by AV, 7-Nov-2024.) |
| Ref | Expression |
|---|---|
| ressbas.r | ⊢ 𝑅 = (𝑊 ↾s 𝐴) |
| ressbas.b | ⊢ 𝐵 = (Base‘𝑊) |
| Ref | Expression |
|---|---|
| ressbas | ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ressbas.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑊) | |
| 2 | simp1 1136 | . . . . . 6 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝐵 ⊆ 𝐴) | |
| 3 | sseqin2 4173 | . . . . . 6 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐵) = 𝐵) | |
| 4 | 2, 3 | sylib 218 | . . . . 5 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = 𝐵) |
| 5 | ressbas.r | . . . . . . 7 ⊢ 𝑅 = (𝑊 ↾s 𝐴) | |
| 6 | 5, 1 | ressid2 17159 | . . . . . 6 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = 𝑊) |
| 7 | 6 | fveq2d 6836 | . . . . 5 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (Base‘𝑅) = (Base‘𝑊)) |
| 8 | 1, 4, 7 | 3eqtr4a 2795 | . . . 4 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 9 | 8 | 3expib 1122 | . . 3 ⊢ (𝐵 ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅))) |
| 10 | simp2 1137 | . . . . . 6 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑊 ∈ V) | |
| 11 | 1 | fvexi 6846 | . . . . . . 7 ⊢ 𝐵 ∈ V |
| 12 | 11 | inex2 5261 | . . . . . 6 ⊢ (𝐴 ∩ 𝐵) ∈ V |
| 13 | baseid 17137 | . . . . . . 7 ⊢ Base = Slot (Base‘ndx) | |
| 14 | 13 | setsid 17132 | . . . . . 6 ⊢ ((𝑊 ∈ V ∧ (𝐴 ∩ 𝐵) ∈ V) → (𝐴 ∩ 𝐵) = (Base‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉))) |
| 15 | 10, 12, 14 | sylancl 586 | . . . . 5 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉))) |
| 16 | 5, 1 | ressval2 17160 | . . . . . 6 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉)) |
| 17 | 16 | fveq2d 6836 | . . . . 5 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (Base‘𝑅) = (Base‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉))) |
| 18 | 15, 17 | eqtr4d 2772 | . . . 4 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 19 | 18 | 3expib 1122 | . . 3 ⊢ (¬ 𝐵 ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅))) |
| 20 | 9, 19 | pm2.61i 182 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 21 | in0 4345 | . . . . 5 ⊢ (𝐴 ∩ ∅) = ∅ | |
| 22 | fvprc 6824 | . . . . . . 7 ⊢ (¬ 𝑊 ∈ V → (Base‘𝑊) = ∅) | |
| 23 | 1, 22 | eqtrid 2781 | . . . . . 6 ⊢ (¬ 𝑊 ∈ V → 𝐵 = ∅) |
| 24 | 23 | ineq2d 4170 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (𝐴 ∩ 𝐵) = (𝐴 ∩ ∅)) |
| 25 | 21, 24, 22 | 3eqtr4a 2795 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝐴 ∩ 𝐵) = (Base‘𝑊)) |
| 26 | base0 17139 | . . . . . 6 ⊢ ∅ = (Base‘∅) | |
| 27 | 26 | eqcomi 2743 | . . . . 5 ⊢ (Base‘∅) = ∅ |
| 28 | reldmress 17157 | . . . . 5 ⊢ Rel dom ↾s | |
| 29 | 27, 5, 28 | oveqprc 17117 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (Base‘𝑊) = (Base‘𝑅)) |
| 30 | 25, 29 | eqtrd 2769 | . . 3 ⊢ (¬ 𝑊 ∈ V → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 31 | 30 | adantr 480 | . 2 ⊢ ((¬ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 32 | 20, 31 | pm2.61ian 811 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 Vcvv 3438 ∩ cin 3898 ⊆ wss 3899 ∅c0 4283 〈cop 4584 ‘cfv 6490 (class class class)co 7356 sSet csts 17088 ndxcnx 17118 Basecbs 17134 ↾s cress 17155 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-1cn 11082 ax-addcl 11084 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-nn 12144 df-sets 17089 df-slot 17107 df-ndx 17119 df-base 17135 df-ress 17156 |
| This theorem is referenced by: ressbasssg 17162 ressbas2 17163 ressbasssOLD 17165 ressress 17172 xrge0base 17526 rescabs 17755 resscatc 18031 resspos 18350 resstos 18351 idresefmnd 18822 smndex1bas 18829 resscntz 19260 idrespermg 19338 submomnd 20059 opprsubg 20286 subrngpropd 20499 subrgpropd 20539 suborng 20807 sralmod 21137 lidlssbas 21166 lidlbas 21167 resstopn 23128 resstps 23129 ressuss 24204 ressxms 24467 ressms 24468 cphsubrglem 25131 cphsscph 25205 xrge00 33045 gsumge0cl 46557 sge0tsms 46566 uzlidlring 48423 dmatALTbas 48589 |
| Copyright terms: Public domain | W3C validator |