| 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 1154 | . . . . . 6 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝐵 ⊆ 𝐴) | |
| 3 | sseqin2 4176 | . . . . . 6 ⊢ (𝐵 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐵) = 𝐵) | |
| 4 | 2, 3 | sylib 221 | . . . . 5 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = 𝐵) |
| 5 | ressbas.r | . . . . . . 7 ⊢ 𝑅 = (𝑊 ↾s 𝐴) | |
| 6 | 5, 1 | ressid2 17289 | . . . . . 6 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = 𝑊) |
| 7 | 6 | fveq2d 6885 | . . . . 5 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (Base‘𝑅) = (Base‘𝑊)) |
| 8 | 1, 4, 7 | 3eqtr4a 2824 | . . . 4 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 9 | 8 | 3expib 1140 | . . 3 ⊢ (𝐵 ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅))) |
| 10 | simp2 1155 | . . . . . 6 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑊 ∈ V) | |
| 11 | 1 | fvexi 6895 | . . . . . . 7 ⊢ 𝐵 ∈ V |
| 12 | 11 | inex2 5287 | . . . . . 6 ⊢ (𝐴 ∩ 𝐵) ∈ V |
| 13 | baseid 17267 | . . . . . . 7 ⊢ Base = Slot (Base‘ndx) | |
| 14 | 13 | setsid 17262 | . . . . . 6 ⊢ ((𝑊 ∈ V ∧ (𝐴 ∩ 𝐵) ∈ V) → (𝐴 ∩ 𝐵) = (Base‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉))) |
| 15 | 10, 12, 14 | sylancl 597 | . . . . 5 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉))) |
| 16 | 5, 1 | ressval2 17290 | . . . . . 6 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉)) |
| 17 | 16 | fveq2d 6885 | . . . . 5 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (Base‘𝑅) = (Base‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉))) |
| 18 | 15, 17 | eqtr4d 2801 | . . . 4 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 19 | 18 | 3expib 1140 | . . 3 ⊢ (¬ 𝐵 ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅))) |
| 20 | 9, 19 | pm2.61i 184 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐴 ∩ 𝐵) = (Base‘𝑅)) |
| 21 | in0 4352 | . . . . 5 ⊢ (𝐴 ∩ ∅) = ∅ | |
| 22 | fvprc 6873 | . . . . . . 7 ⊢ (¬ 𝑊 ∈ V → (Base‘𝑊) = ∅) | |
| 23 | 1, 22 | eqtrid 2810 | . . . . . 6 ⊢ (¬ 𝑊 ∈ V → 𝐵 = ∅) |
| 24 | 23 | ineq2d 4173 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (𝐴 ∩ 𝐵) = (𝐴 ∩ ∅)) |
| 25 | 21, 24, 22 | 3eqtr4a 2824 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝐴 ∩ 𝐵) = (Base‘𝑊)) |
| 26 | base0 17269 | . . . . . 6 ⊢ ∅ = (Base‘∅) | |
| 27 | 26 | eqcomi 2772 | . . . . 5 ⊢ (Base‘∅) = ∅ |
| 28 | reldmress 17287 | . . . . 5 ⊢ Rel dom ↾s | |
| 29 | 27, 5, 28 | oveqprc 17247 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (Base‘𝑊) = (Base‘𝑅)) |
| 30 | 25, 29 | eqtrd 2798 | . . 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 1103 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∩ cin 3904 ⊆ wss 3905 ∅c0 4286 〈cop 4595 ‘cfv 6536 (class class class)co 7410 sSet csts 17218 ndxcnx 17248 Basecbs 17264 ↾s cress 17285 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-1cn 11153 ax-addcl 11155 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-nn 12229 df-sets 17219 df-slot 17237 df-ndx 17249 df-base 17265 df-ress 17286 |
| This theorem is referenced by: ressbasssg 17292 ressbas2 17293 ressbasssOLD 17295 ressress 17302 xrge0base 17656 rescabs 17885 resscatc 18161 resspos 18480 resstos 18481 idresefmnd 18953 smndex1bas 18963 resscntz 19398 idrespermg 19476 submomnd 20197 opprsubg 20430 subrngpropd 20667 subrgpropd 20707 suborng 20979 sralmod 21308 lidlssbas 21338 lidlbas 21339 resstopn 23343 resstps 23344 ressuss 24419 ressxms 24682 ressms 24683 cphsubrglem 25336 cphsscph 25410 xrge00 33334 gsumge0cl 47085 sge0tsms 47094 uzlidlring 49000 dmatALTbas 49181 |
| Copyright terms: Public domain | W3C validator |