| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ressval2 | GIF version | ||
| Description: Value of nontrivial structure restriction. (Contributed by Stefan O'Rear, 29-Nov-2014.) |
| Ref | Expression |
|---|---|
| ressbas.r | ⊢ 𝑅 = (𝑊 ↾s 𝐴) |
| ressbas.b | ⊢ 𝐵 = (Base‘𝑊) |
| Ref | Expression |
|---|---|
| ressval2 | ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ressvalsets 12896 | . . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → (𝑊 ↾s 𝐴) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) | |
| 2 | ressbas.r | . . 3 ⊢ 𝑅 = (𝑊 ↾s 𝐴) | |
| 3 | ressbas.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑊) | |
| 4 | 3 | ineq2i 3371 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) = (𝐴 ∩ (Base‘𝑊)) |
| 5 | 4 | opeq2i 3823 | . . . 4 ⊢ 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉 = 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉 |
| 6 | 5 | oveq2i 5955 | . . 3 ⊢ (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉) = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉) |
| 7 | 1, 2, 6 | 3eqtr4g 2263 | . 2 ⊢ ((𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉)) |
| 8 | 7 | 3adant1 1018 | 1 ⊢ ((¬ 𝐵 ⊆ 𝐴 ∧ 𝑊 ∈ 𝑋 ∧ 𝐴 ∈ 𝑌) → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ 𝐵)〉)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ∧ w3a 981 = wceq 1373 ∈ wcel 2176 ∩ cin 3165 ⊆ wss 3166 〈cop 3636 ‘cfv 5271 (class class class)co 5944 ndxcnx 12829 sSet csts 12830 Basecbs 12832 ↾s cress 12833 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-sep 4162 ax-pow 4218 ax-pr 4253 ax-un 4480 ax-setind 4585 ax-cnex 8016 ax-resscn 8017 ax-1re 8019 ax-addrcl 8022 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-ral 2489 df-rex 2490 df-rab 2493 df-v 2774 df-sbc 2999 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-int 3886 df-br 4045 df-opab 4106 df-mpt 4107 df-id 4340 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-rn 4686 df-res 4687 df-iota 5232 df-fun 5273 df-fv 5279 df-ov 5947 df-oprab 5948 df-mpo 5949 df-inn 9037 df-ndx 12835 df-slot 12836 df-base 12838 df-sets 12839 df-iress 12840 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |