| 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 4593 | . 2 ⊢ (𝐴 ⊆ On → ∪ 𝐴 ∈ On) |
| 3 | intmin 3953 | . . 3 ⊢ (∪ 𝐴 ∈ On → ∩ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = ∪ 𝐴) | |
| 4 | unissb 3928 | . . . . . 6 ⊢ (∪ 𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥) | |
| 5 | 4 | a1i 9 | . . . . 5 ⊢ (𝑥 ∈ On → (∪ 𝐴 ⊆ 𝑥 ↔ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥)) |
| 6 | 5 | rabbiia 2789 | . . . 4 ⊢ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥} |
| 7 | 6 | inteqi 3937 | . . 3 ⊢ ∩ {𝑥 ∈ On ∣ ∪ 𝐴 ⊆ 𝑥} = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥} |
| 8 | 3, 7 | eqtr3di 2279 | . 2 ⊢ (∪ 𝐴 ∈ On → ∪ 𝐴 = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥}) |
| 9 | 2, 8 | syl 14 | 1 ⊢ (𝐴 ⊆ On → ∪ 𝐴 = ∩ {𝑥 ∈ On ∣ ∀𝑦 ∈ 𝐴 𝑦 ⊆ 𝑥}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1398 ∈ wcel 2202 ∀wral 2511 {crab 2515 Vcvv 2803 ⊆ wss 3201 ∪ cuni 3898 ∩ cint 3933 Oncon0 4466 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-un 4536 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-rab 2520 df-v 2805 df-in 3207 df-ss 3214 df-uni 3899 df-int 3934 df-tr 4193 df-iord 4469 df-on 4471 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |