| 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 4536 | . 2 ⊢ (𝐴 ⊆ On → ∪ 𝐴 ∈ On) |
| 3 | intmin 3904 | . . 3 ⊢ (∪ 𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = ∪ 𝐴) | |
| 4 | unissb 3879 | . . . . . 6 ⊢ (∪ 𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥) | |
| 5 | 4 | a1i 9 | . . . . 5 ⊢ (𝑥 ∈ On → (∪ 𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)) |
| 6 | 5 | rabbiia 2756 | . . . 4 ⊢ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥} |
| 7 | 6 | inteqi 3888 | . . 3 ⊢ ∩ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥} |
| 8 | 3, 7 | eqtr3di 2252 | . 2 ⊢ (∪ 𝐴 ∈ On → ∪ 𝐴 = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥}) |
| 9 | 2, 8 | syl 14 | 1 ⊢ (𝐴 ⊆ On → ∪ 𝐴 = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1372 ∈ wcel 2175 ∀wral 2483 {crab 2487 Vcvv 2771 ⊆ wss 3165 ∪ cuni 3849 ∩ cint 3884 Oncon0 4409 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-un 4479 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ral 2488 df-rex 2489 df-rab 2492 df-v 2773 df-in 3171 df-ss 3178 df-uni 3850 df-int 3885 df-tr 4142 df-iord 4412 df-on 4414 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |