| 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 1152 | . . . . . 6 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝐵 ⊆ 𝐴) | |
| 3 | sseqin2 4184 | . . . . . 6 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐵) = 𝐵) | |
| 4 | 2, 3 | sylib 221 | . . . . 5 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = 𝐵) |
| 5 | ressbas.r | . . . . . . 7 ⊢ 𝑅 = (𝑊 ↾s 𝐴) | |
| 6 | 5, 1 | ressid2 17293 | . . . . . 6 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = 𝑊) |
| 7 | 6 | fveq2d 6886 | . . . . 5 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (Base‘𝑅) = (Base‘𝑊)) |
| 8 | 1, 4, 7 | 3eqtr4a 2830 | . . . 4 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 9 | 8 | 3expib 1138 | . . 3 ⊢ (𝐵 ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅))) |
| 10 | simp2 1153 | . . . . . 6 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑊 ∈ V) | |
| 11 | 1 | fvexi 6896 | . . . . . . 7 ⊢ 𝐵 ∈ V |
| 12 | 11 | inex2 5289 | . . . . . 6 ⊢ (𝐴 ∩ 𝐵) ∈ V |
| 13 | baseid 17271 | . . . . . . 7 ⊢ Base = Slot (Base‘ndx) | |
| 14 | 13 | setsid 17266 | . . . . . 6 ⊢ ((𝑊 ∈ V ∧ (𝐴 ∩ 𝐵) ∈ V) → (𝐴 ∩ 𝐵) = (Base‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉))) |
| 15 | 10, 12, 14 | sylancl 597 | . . . . 5 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉))) |
| 16 | 5, 1 | ressval2 17294 | . . . . . 6 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉)) |
| 17 | 16 | fveq2d 6886 | . . . . 5 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (Base‘𝑅) = (Base‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉))) |
| 18 | 15, 17 | eqtr4d 2807 | . . . 4 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 19 | 18 | 3expib 1138 | . . 3 ⊢ (¬ 𝐵 ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅))) |
| 20 | 9, 19 | pm2.61i 184 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 21 | in0 4359 | . . . . 5 ⊢ (𝐴 ∩ ∅) = ∅ | |
| 22 | fvprc 6874 | . . . . . . 7 ⊢ (¬ 𝑊 ∈ V → (Base‘𝑊) = ∅) | |
| 23 | 1, 22 | eqtrid 2816 | . . . . . 6 ⊢ (¬ 𝑊 ∈ V → 𝐵 = ∅) |
| 24 | 23 | ineq2d 4181 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (𝐴 ∩ 𝐵) = (𝐴 ∩ ∅)) |
| 25 | 21, 24, 22 | 3eqtr4a 2830 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝐴 ∩ 𝐵) = (Base‘𝑊)) |
| 26 | base0 17273 | . . . . . 6 ⊢ ∅ = (Base‘∅) | |
| 27 | 26 | eqcomi 2778 | . . . . 5 ⊢ (Base‘∅) = ∅ |
| 28 | reldmress 17291 | . . . . 5 ⊢ Rel dom ↾s | |
| 29 | 27, 5, 28 | oveqprc 17251 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (Base‘𝑊) = (Base‘𝑅)) |
| 30 | 25, 29 | eqtrd 2804 | . . 3 ⊢ (¬ 𝑊 ∈ V → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 31 | 30 | adantr 485 | . 2 ⊢ ((¬ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 32 | 20, 31 | pm2.61ian 823 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 Vcvv 3463 ∩ cin 3912 ⊆ wss 3913 ∅c0 4294 〈cop 4600 ‘cfv 6537 (class class class)co 7411 sSet csts 17222 ndxcnx 17252 Basecbs 17268 ↾s cress 17289 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-1cn 11157 ax-addcl 11159 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-nn 12233 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 |
| This theorem is referenced by: ressbasssg 17296 ressbas2 17297 ressbasssOLD 17299 ressress 17306 xrge0base 17660 rescabs 17889 resscatc 18165 resspos 18484 resstos 18485 idresefmnd 18957 smndex1bas 18967 resscntz 19402 idrespermg 19480 submomnd 20201 opprsubg 20433 subrngpropd 20652 subrgpropd 20692 suborng 20956 sralmod 21285 lidlssbas 21315 lidlbas 21316 resstopn 23311 resstps 23312 ressuss 24387 ressxms 24650 ressms 24651 cphsubrglem 25304 cphsscph 25378 xrge00 33274 gsumge0cl 46976 sge0tsms 46985 uzlidlring 48888 dmatALTbas 49065 |
| Copyright terms: Public domain | W3C validator |