| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > bm2.5ii | GIF version | ||
| Description: Problem 2.5(ii) of [BellMachover] p. 471. (Contributed by NM, 20-Sep-2003.) |
| Ref | Expression |
|---|---|
| bm2.5ii.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| bm2.5ii | ⊢ (𝐴 ⊆ On → ∪ 𝐴 = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bm2.5ii.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 2 | 1 | ssonunii 4233 | . 2 ⊢ (𝐴 ⊆ On → ∪ 𝐴 ∈ On) |
| 3 | unissb 3631 | . . . . . 6 ⊢ (∪ 𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥) | |
| 4 | 3 | a1i 9 | . . . . 5 ⊢ (𝑥 ∈ On → (∪ 𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)) |
| 5 | 4 | rabbiia 2591 | . . . 4 ⊢ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥} |
| 6 | 5 | inteqi 3640 | . . 3 ⊢ ∩ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥} |
| 7 | intmin 3656 | . . 3 ⊢ (∪ 𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = ∪ 𝐴) | |
| 8 | 6, 7 | syl5reqr 2128 | . 2 ⊢ (∪ 𝐴 ∈ On → ∪ 𝐴 = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥}) |
| 9 | 2, 8 | syl 14 | 1 ⊢ (𝐴 ⊆ On → ∪ 𝐴 = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 103 = wceq 1284 ∈ wcel 1433 ∀wral 2348 {crab 2352 Vcvv 2601 ⊆ wss 2973 ∪ cuni 3601 ∩ cint 3636 Oncon0 4118 |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-un 4188 |
| This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-rex 2354 df-rab 2357 df-v 2603 df-in 2979 df-ss 2986 df-uni 3602 df-int 3637 df-tr 3876 df-iord 4121 df-on 4123 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |