| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: The rationals are a subset of the complex numbers. |
| Ref | Expression |
|---|---|
| qsscn |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qssre 7902 |
. 2
| |
| 2 | ax-resscn 6886 |
. 2
| |
| 3 | 1, 2 | sstri 2888 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: qcn 7905 qexpcl 8322 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1621 ax-gen 1622 ax-8 1623 ax-9 1624 ax-10 1625 ax-11 1626 ax-12 1627 ax-13 1628 ax-14 1629 ax-17 1634 ax-4 1637 ax-5o 1639 ax-6o 1642 ax-9o 1792 ax-10o 1810 ax-16 1883 ax-11o 1893 ax-ext 2152 ax-rep 3628 ax-sep 3638 ax-nul 3645 ax-pow 3681 ax-pr 3719 ax-un 3961 ax-cnex 6885 ax-resscn 6886 ax-1cn 6887 ax-icn 6888 ax-addcl 6889 ax-addrcl 6890 ax-mulcl 6891 ax-mulrcl 6892 ax-mulcom 6893 ax-addass 6894 ax-mulass 6895 ax-distr 6896 ax-i2m1 6897 ax-1ne0 6898 ax-1rid 6899 ax-rnegex 6900 ax-rrecex 6901 ax-cnre 6902 ax-pre-lttri 6903 ax-pre-lttrn 6904 ax-pre-ltadd 6905 ax-pre-mulgt0 6906 |
| This theorem depends on definitions: df-bi 232 df-or 434 df-an 435 df-3or 1131 df-3an 1132 df-ex 1645 df-sb 1845 df-eu 2070 df-mo 2071 df-clab 2158 df-cleq 2163 df-clel 2166 df-ne 2297 df-nel 2298 df-ral 2389 df-rex 2390 df-reu 2391 df-rab 2392 df-v 2571 df-sbc 2731 df-csb 2806 df-dif 2862 df-un 2864 df-in 2866 df-ss 2868 df-nul 3115 df-if 3213 df-pw 3261 df-sn 3274 df-pr 3275 df-op 3278 df-uni 3399 df-int 3433 df-br 3540 df-opab 3598 df-id 3779 df-po 3784 df-so 3796 df-xp 4165 df-rel 4166 df-cnv 4167 df-co 4168 df-dm 4169 df-rn 4170 df-res 4171 df-ima 4172 df-fun 4173 df-fn 4174 df-f 4175 df-f1 4176 df-fo 4177 df-f1o 4178 df-fv 4179 df-opr 5022 df-oprab 5023 df-mpt 5138 df-iota 5259 df-er 5519 df-en 5631 df-dom 5632 df-sdom 5633 df-undef 5769 df-riota 5773 df-pnf 6948 df-mnf 6949 df-xr 6950 df-ltxr 6951 df-le 6952 df-sub 7111 df-neg 7113 df-div 7325 df-n 7543 df-z 7798 df-q 7894 |