| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > recnprss | GIF version | ||
| Description: Both ℝ and ℂ are subsets of ℂ. (Contributed by Mario Carneiro, 10-Feb-2015.) |
| Ref | Expression |
|---|---|
| recnprss | ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elpri 3689 | . 2 ⊢ (𝑆 ∈ {ℝ, ℂ} → (𝑆 = ℝ ∨ 𝑆 = ℂ)) | |
| 2 | ax-resscn 8079 | . . . 4 ⊢ ℝ ⊆ ℂ | |
| 3 | sseq1 3247 | . . . 4 ⊢ (𝑆 = ℝ → (𝑆 ⊆ ℂ ↔ ℝ ⊆ ℂ)) | |
| 4 | 2, 3 | mpbiri 168 | . . 3 ⊢ (𝑆 = ℝ → 𝑆 ⊆ ℂ) |
| 5 | eqimss 3278 | . . 3 ⊢ (𝑆 = ℂ → 𝑆 ⊆ ℂ) | |
| 6 | 4, 5 | jaoi 721 | . 2 ⊢ ((𝑆 = ℝ ∨ 𝑆 = ℂ) → 𝑆 ⊆ ℂ) |
| 7 | 1, 6 | syl 14 | 1 ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∨ wo 713 = wceq 1395 ∈ wcel 2200 ⊆ wss 3197 {cpr 3667 ℂcc 7985 ℝcr 7986 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 ax-resscn 8079 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-sn 3672 df-pr 3673 |
| This theorem is referenced by: dvfgg 15347 dvidsslem 15352 dvconstss 15357 dvaddxx 15362 dvmulxx 15363 dviaddf 15364 dvimulf 15365 dvmptfsum 15384 |
| Copyright terms: Public domain | W3C validator |