![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ismred2 | Structured version Visualization version GIF version |
Description: Properties that determine a Moore collection, using restricted intersection. (Contributed by Stefan O'Rear, 3-Apr-2015.) |
Ref | Expression |
---|---|
ismred2.ss | ⊢ (𝜑 → 𝐶 ⊆ 𝒫 𝑋) |
ismred2.in | ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐶) → (𝑋 ∩ ∩ 𝑠) ∈ 𝐶) |
Ref | Expression |
---|---|
ismred2 | ⊢ (𝜑 → 𝐶 ∈ (Moore‘𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ismred2.ss | . 2 ⊢ (𝜑 → 𝐶 ⊆ 𝒫 𝑋) | |
2 | eqid 2798 | . . . 4 ⊢ ∅ = ∅ | |
3 | rint0 4878 | . . . 4 ⊢ (∅ = ∅ → (𝑋 ∩ ∩ ∅) = 𝑋) | |
4 | 2, 3 | ax-mp 5 | . . 3 ⊢ (𝑋 ∩ ∩ ∅) = 𝑋 |
5 | 0ss 4304 | . . . 4 ⊢ ∅ ⊆ 𝐶 | |
6 | 0ex 5175 | . . . . 5 ⊢ ∅ ∈ V | |
7 | sseq1 3940 | . . . . . . 7 ⊢ (𝑠 = ∅ → (𝑠 ⊆ 𝐶 ↔ ∅ ⊆ 𝐶)) | |
8 | 7 | anbi2d 631 | . . . . . 6 ⊢ (𝑠 = ∅ → ((𝜑 ∧ 𝑠 ⊆ 𝐶) ↔ (𝜑 ∧ ∅ ⊆ 𝐶))) |
9 | inteq 4841 | . . . . . . . 8 ⊢ (𝑠 = ∅ → ∩ 𝑠 = ∩ ∅) | |
10 | 9 | ineq2d 4139 | . . . . . . 7 ⊢ (𝑠 = ∅ → (𝑋 ∩ ∩ 𝑠) = (𝑋 ∩ ∩ ∅)) |
11 | 10 | eleq1d 2874 | . . . . . 6 ⊢ (𝑠 = ∅ → ((𝑋 ∩ ∩ 𝑠) ∈ 𝐶 ↔ (𝑋 ∩ ∩ ∅) ∈ 𝐶)) |
12 | 8, 11 | imbi12d 348 | . . . . 5 ⊢ (𝑠 = ∅ → (((𝜑 ∧ 𝑠 ⊆ 𝐶) → (𝑋 ∩ ∩ 𝑠) ∈ 𝐶) ↔ ((𝜑 ∧ ∅ ⊆ 𝐶) → (𝑋 ∩ ∩ ∅) ∈ 𝐶))) |
13 | ismred2.in | . . . . 5 ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐶) → (𝑋 ∩ ∩ 𝑠) ∈ 𝐶) | |
14 | 6, 12, 13 | vtocl 3507 | . . . 4 ⊢ ((𝜑 ∧ ∅ ⊆ 𝐶) → (𝑋 ∩ ∩ ∅) ∈ 𝐶) |
15 | 5, 14 | mpan2 690 | . . 3 ⊢ (𝜑 → (𝑋 ∩ ∩ ∅) ∈ 𝐶) |
16 | 4, 15 | eqeltrrid 2895 | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝐶) |
17 | simp2 1134 | . . . . 5 ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐶 ∧ 𝑠 ≠ ∅) → 𝑠 ⊆ 𝐶) | |
18 | 1 | 3ad2ant1 1130 | . . . . 5 ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐶 ∧ 𝑠 ≠ ∅) → 𝐶 ⊆ 𝒫 𝑋) |
19 | 17, 18 | sstrd 3925 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐶 ∧ 𝑠 ≠ ∅) → 𝑠 ⊆ 𝒫 𝑋) |
20 | simp3 1135 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐶 ∧ 𝑠 ≠ ∅) → 𝑠 ≠ ∅) | |
21 | rintn0 4994 | . . . 4 ⊢ ((𝑠 ⊆ 𝒫 𝑋 ∧ 𝑠 ≠ ∅) → (𝑋 ∩ ∩ 𝑠) = ∩ 𝑠) | |
22 | 19, 20, 21 | syl2anc 587 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐶 ∧ 𝑠 ≠ ∅) → (𝑋 ∩ ∩ 𝑠) = ∩ 𝑠) |
23 | 13 | 3adant3 1129 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐶 ∧ 𝑠 ≠ ∅) → (𝑋 ∩ ∩ 𝑠) ∈ 𝐶) |
24 | 22, 23 | eqeltrrd 2891 | . 2 ⊢ ((𝜑 ∧ 𝑠 ⊆ 𝐶 ∧ 𝑠 ≠ ∅) → ∩ 𝑠 ∈ 𝐶) |
25 | 1, 16, 24 | ismred 16865 | 1 ⊢ (𝜑 → 𝐶 ∈ (Moore‘𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∩ cin 3880 ⊆ wss 3881 ∅c0 4243 𝒫 cpw 4497 ∩ cint 4838 ‘cfv 6324 Moorecmre 16845 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-int 4839 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-iota 6283 df-fun 6326 df-fv 6332 df-mre 16849 |
This theorem is referenced by: isacs1i 16920 mreacs 16921 |
Copyright terms: Public domain | W3C validator |