| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ruc | Structured version Visualization version GIF version | ||
| Description: The set of positive integers is strictly dominated by the set of real numbers, i.e. the real numbers are uncountable. The proof consists of lemmas ruclem1 16254 through ruclem13 16265 and this final piece. Our proof is based on the proof of Theorem 5.18 of [Truss] p. 114. See ruclem13 16265 for the function existence version of this theorem. For an informal discussion of this proof, see mmcomplex.html#uncountable 16265. For an alternate proof see rucALT 16253. This is Metamath 100 proof #22. (Contributed by NM, 13-Oct-2004.) |
| Ref | Expression |
|---|---|
| ruc | ⊢ ℕ ≺ ℝ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reex 11158 | . . 3 ⊢ ℝ ∈ V | |
| 2 | nnssre 12208 | . . 3 ⊢ ℕ ⊆ ℝ | |
| 3 | ssdomg 8975 | . . 3 ⊢ (ℝ ∈ V → (ℕ ⊆ ℝ → ℕ ≼ ℝ)) | |
| 4 | 1, 2, 3 | mp2 9 | . 2 ⊢ ℕ ≼ ℝ |
| 5 | ruclem13 16265 | . . . . 5 ⊢ ¬ 𝑓:ℕ–onto→ℝ | |
| 6 | f1ofo 6809 | . . . . 5 ⊢ (𝑓:ℕ–1-1-onto→ℝ → 𝑓:ℕ–onto→ℝ) | |
| 7 | 5, 6 | mto 199 | . . . 4 ⊢ ¬ 𝑓:ℕ–1-1-onto→ℝ |
| 8 | 7 | nex 1819 | . . 3 ⊢ ¬ ∃𝑓 𝑓:ℕ–1-1-onto→ℝ |
| 9 | bren 8931 | . . 3 ⊢ (ℕ ≈ ℝ ↔ ∃𝑓 𝑓:ℕ–1-1-onto→ℝ) | |
| 10 | 8, 9 | mtbir 325 | . 2 ⊢ ¬ ℕ ≈ ℝ |
| 11 | brsdom 8949 | . 2 ⊢ (ℕ ≺ ℝ ↔ (ℕ ≼ ℝ ∧ ¬ ℕ ≈ ℝ)) | |
| 12 | 4, 10, 11 | mpbir2an 721 | 1 ⊢ ℕ ≺ ℝ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∃wex 1798 ∈ wcel 2141 Vcvv 3453 ⊆ wss 3902 class class class wbr 5097 –onto→wfo 6514 –1-1-onto→wf1o 6515 ≈ cen 8918 ≼ cdom 8919 ≺ csdm 8920 ℝcr 11066 ℕcn 12204 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 ax-pre-sup 11145 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-sup 9382 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-div 11839 df-nn 12205 df-2 12274 df-n0 12476 df-z 12563 df-uz 12834 df-fz 13507 df-seq 14009 |
| This theorem is referenced by: resdomq 16267 aleph1re 16268 aleph1irr 16269 |
| Copyright terms: Public domain | W3C validator |