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 2738 | . . . . . 6 ⊢ (𝑊 ↾s 𝐴) = (𝑊 ↾s 𝐴) | |
3 | eqid 2738 | . . . . . 6 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
4 | 2, 3 | ressval 16870 | . . . . 5 ⊢ ((𝑊 ∈ 𝑈 ∧ 𝐴 ∈ V) → (𝑊 ↾s 𝐴) = if((Base‘𝑊) ⊆ 𝐴, 𝑊, (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
5 | 1, 4 | sylan 579 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → (𝑊 ↾s 𝐴) = if((Base‘𝑊) ⊆ 𝐴, 𝑊, (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
6 | wunress.1 | . . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ WUni) | |
7 | wunress.2 | . . . . . . . . 9 ⊢ (𝜑 → ω ∈ 𝑈) | |
8 | 6, 7 | basndxelwund 16852 | . . . . . . . 8 ⊢ (𝜑 → (Base‘ndx) ∈ 𝑈) |
9 | incom 4131 | . . . . . . . . 9 ⊢ (𝐴 ∩ (Base‘𝑊)) = ((Base‘𝑊) ∩ 𝐴) | |
10 | baseid 16843 | . . . . . . . . . . 11 ⊢ Base = Slot (Base‘ndx) | |
11 | 10, 6, 1 | wunstr 16817 | . . . . . . . . . 10 ⊢ (𝜑 → (Base‘𝑊) ∈ 𝑈) |
12 | 6, 11 | wunin 10400 | . . . . . . . . 9 ⊢ (𝜑 → ((Base‘𝑊) ∩ 𝐴) ∈ 𝑈) |
13 | 9, 12 | eqeltrid 2843 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 ∩ (Base‘𝑊)) ∈ 𝑈) |
14 | 6, 8, 13 | wunop 10409 | . . . . . . 7 ⊢ (𝜑 → 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉 ∈ 𝑈) |
15 | 6, 1, 14 | wunsets 16806 | . . . . . 6 ⊢ (𝜑 → (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉) ∈ 𝑈) |
16 | 1, 15 | ifcld 4502 | . . . . 5 ⊢ (𝜑 → if((Base‘𝑊) ⊆ 𝐴, 𝑊, (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) ∈ 𝑈) |
17 | 16 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → if((Base‘𝑊) ⊆ 𝐴, 𝑊, (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) ∈ 𝑈) |
18 | 5, 17 | eqeltrd 2839 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → (𝑊 ↾s 𝐴) ∈ 𝑈) |
19 | 18 | ex 412 | . 2 ⊢ (𝜑 → (𝐴 ∈ V → (𝑊 ↾s 𝐴) ∈ 𝑈)) |
20 | 6 | wun0 10405 | . . 3 ⊢ (𝜑 → ∅ ∈ 𝑈) |
21 | reldmress 16869 | . . . . 5 ⊢ Rel dom ↾s | |
22 | 21 | ovprc2 7295 | . . . 4 ⊢ (¬ 𝐴 ∈ V → (𝑊 ↾s 𝐴) = ∅) |
23 | 22 | eleq1d 2823 | . . 3 ⊢ (¬ 𝐴 ∈ V → ((𝑊 ↾s 𝐴) ∈ 𝑈 ↔ ∅ ∈ 𝑈)) |
24 | 20, 23 | syl5ibrcom 246 | . 2 ⊢ (𝜑 → (¬ 𝐴 ∈ V → (𝑊 ↾s 𝐴) ∈ 𝑈)) |
25 | 19, 24 | pm2.61d 179 | 1 ⊢ (𝜑 → (𝑊 ↾s 𝐴) ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ∩ cin 3882 ⊆ wss 3883 ∅c0 4253 ifcif 4456 〈cop 4564 ‘cfv 6418 (class class class)co 7255 ωcom 7687 WUnicwun 10387 sSet csts 16792 ndxcnx 16822 Basecbs 16840 ↾s cress 16867 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cnex 10858 ax-1cn 10860 ax-addcl 10862 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-oadd 8271 df-omul 8272 df-er 8456 df-ec 8458 df-qs 8462 df-map 8575 df-pm 8576 df-wun 10389 df-ni 10559 df-pli 10560 df-mi 10561 df-lti 10562 df-plpq 10595 df-mpq 10596 df-ltpq 10597 df-enq 10598 df-nq 10599 df-erq 10600 df-plq 10601 df-mq 10602 df-1nq 10603 df-rq 10604 df-ltnq 10605 df-np 10668 df-plp 10670 df-ltp 10672 df-enr 10742 df-nr 10743 df-c 10808 df-nn 11904 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |