| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wunress | Structured version Visualization version GIF version | ||
| Description: Closure of structure restriction in a weak universe. (Contributed by Mario Carneiro, 12-Jan-2017.) (Proof shortened by AV, 28-Oct-2024.) |
| Ref | Expression |
|---|---|
| wunress.1 | ⊢ (𝜑 → 𝑈 ∈ WUni) |
| wunress.2 | ⊢ (𝜑 → ω ∈ 𝑈) |
| wunress.3 | ⊢ (𝜑 → 𝑊 ∈ 𝑈) |
| Ref | Expression |
|---|---|
| wunress | ⊢ (𝜑 → (𝑊 ↾s 𝐴) ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wunress.3 | . . . . 5 ⊢ (𝜑 → 𝑊 ∈ 𝑈) | |
| 2 | eqid 2763 | . . . . . 6 ⊢ (𝑊 ↾s 𝐴) = (𝑊 ↾s 𝐴) | |
| 3 | eqid 2763 | . . . . . 6 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 4 | 2, 3 | ressval 17455 | . . . . 5 ⊢ ((𝑊 ∈ 𝑈 ∧ 𝐴 ∈ V) → (𝑊 ↾s 𝐴) = if((Base‘𝑊) ⊆ 𝐴, 𝑊, (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 5 | 1, 4 | sylan 592 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → (𝑊 ↾s 𝐴) = if((Base‘𝑊) ⊆ 𝐴, 𝑊, (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
| 6 | wunress.1 | . . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ WUni) | |
| 7 | wunress.2 | . . . . . . . . 9 ⊢ (𝜑 → ω ∈ 𝑈) | |
| 8 | 6, 7 | basndxelwund 17442 | . . . . . . . 8 ⊢ (𝜑 → (Base‘ndx) ∈ 𝑈) |
| 9 | incom 4109 | . . . . . . . . 9 ⊢ (𝐴 ∩ (Base‘𝑊)) = ((Base‘𝑊) ∩ 𝐴) | |
| 10 | baseid 17434 | . . . . . . . . . . 11 ⊢ Base = Slot (Base‘ndx) | |
| 11 | 10, 6, 1 | wunstr 17410 | . . . . . . . . . 10 ⊢ (𝜑 → (Base‘𝑊) ∈ 𝑈) |
| 12 | 6, 11 | wunin 10837 | . . . . . . . . 9 ⊢ (𝜑 → ((Base‘𝑊) ∩ 𝐴) ∈ 𝑈) |
| 13 | 9, 12 | eqeltrid 2868 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 ∩ (Base‘𝑊)) ∈ 𝑈) |
| 14 | 6, 8, 13 | wunop 10846 | . . . . . . 7 ⊢ (𝜑 → 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉 ∈ 𝑈) |
| 15 | 6, 1, 14 | wunsets 17399 | . . . . . 6 ⊢ (𝜑 → (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉) ∈ 𝑈) |
| 16 | 1, 15 | ifcld 4532 | . . . . 5 ⊢ (𝜑 → if((Base‘𝑊) ⊆ 𝐴, 𝑊, (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) ∈ 𝑈) |
| 17 | 16 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → if((Base‘𝑊) ⊆ 𝐴, 𝑊, (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) ∈ 𝑈) |
| 18 | 5, 17 | eqeltrd 2864 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → (𝑊 ↾s 𝐴) ∈ 𝑈) |
| 19 | 18 | ex 418 | . 2 ⊢ (𝜑 → (𝐴 ∈ V → (𝑊 ↾s 𝐴) ∈ 𝑈)) |
| 20 | 6 | wun0 10842 | . . 3 ⊢ (𝜑 → ∅ ∈ 𝑈) |
| 21 | reldmress 17454 | . . . . 5 ⊢ Rel dom ↾s | |
| 22 | 21 | ovprc2 7491 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (𝑊 ↾s 𝐴) = ∅) |
| 23 | 22 | eleq1d 2849 | . . 3 ⊢ (¬ 𝐴 ∈ V → ((𝑊 ↾s 𝐴) ∈ 𝑈 ↔ ∅ ∈ 𝑈)) |
| 24 | 20, 23 | syl5ibrcom 250 | . 2 ⊢ (𝜑 → (¬ 𝐴 ∈ V → (𝑊 ↾s 𝐴) ∈ 𝑈)) |
| 25 | 19, 24 | pm2.61d 181 | 1 ⊢ (𝜑 → (𝑊 ↾s 𝐴) ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 ∩ cin 4092 ∅c0 4281 ifcif 4485 〈cop 4840 ‘cfv 6566 (class class class)co 7451 ωcom 7911 WUnicwun 10824 sSet csts 17385 ndxcnx 17415 Basecbs 17431 ↾s cress 17452 |
| 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-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-inf2 9679 ax-cnex 11295 ax-1cn 11297 ax-addcl 11299 |
| 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-rmo 3369 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-int 4913 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-pred 6330 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-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-oadd 8518 df-omul 8519 df-er 8755 df-ec 8757 df-qs 8761 df-map 8887 df-pm 8888 df-wun 10826 df-ni 10996 df-pli 10997 df-mi 10998 df-lti 10999 df-plpq 11032 df-mpq 11033 df-ltpq 11034 df-enq 11035 df-nq 11036 df-erq 11037 df-plq 11038 df-mq 11039 df-1nq 11040 df-rq 11041 df-ltnq 11042 df-np 11105 df-plp 11107 df-ltp 11109 df-enr 11179 df-nr 11180 df-c 11245 df-nn 12376 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |