Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iscnrm | Structured version Visualization version GIF version |
Description: The property of being completely or hereditarily normal. (Contributed by Mario Carneiro, 26-Aug-2015.) |
Ref | Expression |
---|---|
ist0.1 | ⊢ 𝑋 = ∪ 𝐽 |
Ref | Expression |
---|---|
iscnrm | ⊢ (𝐽 ∈ CNrm ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝒫 𝑋(𝐽 ↾t 𝑥) ∈ Nrm)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unieq 4847 | . . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽) | |
2 | ist0.1 | . . . . 5 ⊢ 𝑋 = ∪ 𝐽 | |
3 | 1, 2 | eqtr4di 2797 | . . . 4 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = 𝑋) |
4 | 3 | pweqd 4549 | . . 3 ⊢ (𝑗 = 𝐽 → 𝒫 ∪ 𝑗 = 𝒫 𝑋) |
5 | oveq1 7262 | . . . 4 ⊢ (𝑗 = 𝐽 → (𝑗 ↾t 𝑥) = (𝐽 ↾t 𝑥)) | |
6 | 5 | eleq1d 2823 | . . 3 ⊢ (𝑗 = 𝐽 → ((𝑗 ↾t 𝑥) ∈ Nrm ↔ (𝐽 ↾t 𝑥) ∈ Nrm)) |
7 | 4, 6 | raleqbidv 3327 | . 2 ⊢ (𝑗 = 𝐽 → (∀𝑥 ∈ 𝒫 ∪ 𝑗(𝑗 ↾t 𝑥) ∈ Nrm ↔ ∀𝑥 ∈ 𝒫 𝑋(𝐽 ↾t 𝑥) ∈ Nrm)) |
8 | df-cnrm 22377 | . 2 ⊢ CNrm = {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝒫 ∪ 𝑗(𝑗 ↾t 𝑥) ∈ Nrm} | |
9 | 7, 8 | elrab2 3620 | 1 ⊢ (𝐽 ∈ CNrm ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝒫 𝑋(𝐽 ↾t 𝑥) ∈ Nrm)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∀wral 3063 𝒫 cpw 4530 ∪ cuni 4836 (class class class)co 7255 ↾t crest 17048 Topctop 21950 Nrmcnrm 22369 CNrmccnrm 22370 |
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-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-iota 6376 df-fv 6426 df-ov 7258 df-cnrm 22377 |
This theorem is referenced by: cnrmtop 22396 iscnrm2 22397 cnrmi 22419 iscnrm3 46134 |
Copyright terms: Public domain | W3C validator |