| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wuncn | Structured version Visualization version GIF version | ||
| Description: A weak universe containing ω contains the complex number construction. This theorem is construction-dependent in the literal sense, but will also be satisfied by any other reasonable implementation of the complex numbers. (Contributed by Mario Carneiro, 2-Jan-2017.) |
| Ref | Expression |
|---|---|
| wuncn.1 | ⊢ (𝜑 → 𝑈 ∈ WUni) |
| wuncn.2 | ⊢ (𝜑 → ω ∈ 𝑈) |
| Ref | Expression |
|---|---|
| wuncn | ⊢ (𝜑 → ℂ ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-c 11245 | . 2 ⊢ ℂ = (R × R) | |
| 2 | wuncn.1 | . . 3 ⊢ (𝜑 → 𝑈 ∈ WUni) | |
| 3 | df-nr 11180 | . . . 4 ⊢ R = ((P × P) / ~R ) | |
| 4 | df-ni 10996 | . . . . . . . . . . . 12 ⊢ N = (ω ∖ {∅}) | |
| 5 | wuncn.2 | . . . . . . . . . . . . 13 ⊢ (𝜑 → ω ∈ 𝑈) | |
| 6 | 2, 5 | wundif 10838 | . . . . . . . . . . . 12 ⊢ (𝜑 → (ω ∖ {∅}) ∈ 𝑈) |
| 7 | 4, 6 | eqeltrid 2868 | . . . . . . . . . . 11 ⊢ (𝜑 → N ∈ 𝑈) |
| 8 | 2, 7, 7 | wunxp 10848 | . . . . . . . . . 10 ⊢ (𝜑 → (N × N) ∈ 𝑈) |
| 9 | elpqn 11049 | . . . . . . . . . . . 12 ⊢ (𝑥 ∈ Q → 𝑥 ∈ (N × N)) | |
| 10 | 9 | ssriv 3917 | . . . . . . . . . . 11 ⊢ Q ⊆ (N × N) |
| 11 | 10 | a1i 11 | . . . . . . . . . 10 ⊢ (𝜑 → Q ⊆ (N × N)) |
| 12 | 2, 8, 11 | wunss 10836 | . . . . . . . . 9 ⊢ (𝜑 → Q ∈ 𝑈) |
| 13 | 2, 12 | wunpw 10831 | . . . . . . . 8 ⊢ (𝜑 → 𝒫 Q ∈ 𝑈) |
| 14 | prpssnq 11114 | . . . . . . . . . . . 12 ⊢ (𝑥 ∈ P → 𝑥 ⊊ Q) | |
| 15 | 14 | pssssd 4030 | . . . . . . . . . . 11 ⊢ (𝑥 ∈ P → 𝑥 ⊆ Q) |
| 16 | velpw 4565 | . . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝒫 Q ↔ 𝑥 ⊆ Q) | |
| 17 | 15, 16 | sylibr 237 | . . . . . . . . . 10 ⊢ (𝑥 ∈ P → 𝑥 ∈ 𝒫 Q) |
| 18 | 17 | ssriv 3917 | . . . . . . . . 9 ⊢ P ⊆ 𝒫 Q |
| 19 | 18 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → P ⊆ 𝒫 Q) |
| 20 | 2, 13, 19 | wunss 10836 | . . . . . . 7 ⊢ (𝜑 → P ∈ 𝑈) |
| 21 | 2, 20, 20 | wunxp 10848 | . . . . . 6 ⊢ (𝜑 → (P × P) ∈ 𝑈) |
| 22 | 2, 21 | wunpw 10831 | . . . . 5 ⊢ (𝜑 → 𝒫 (P × P) ∈ 𝑈) |
| 23 | enrer 11187 | . . . . . . 7 ⊢ ~R Er (P × P) | |
| 24 | 23 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ~R Er (P × P)) |
| 25 | 24 | qsss 8834 | . . . . 5 ⊢ (𝜑 → ((P × P) / ~R ) ⊆ 𝒫 (P × P)) |
| 26 | 2, 22, 25 | wunss 10836 | . . . 4 ⊢ (𝜑 → ((P × P) / ~R ) ∈ 𝑈) |
| 27 | 3, 26 | eqeltrid 2868 | . . 3 ⊢ (𝜑 → R ∈ 𝑈) |
| 28 | 2, 27, 27 | wunxp 10848 | . 2 ⊢ (𝜑 → (R × R) ∈ 𝑈) |
| 29 | 1, 28 | eqeltrid 2868 | 1 ⊢ (𝜑 → ℂ ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2147 ⊆ wss 3900 ∖ cdif 4048 ∅c0 4281 𝒫 cpw 4560 {csn 4588 × cxp 5656 ωcom 7911 Er wer 8752 / cqs 8754 WUnicwun 10824 Ncnpi 10968 Qcnq 10976 Pcnp 10983 ~R cer 10988 Rcnr 10989 ℂcc 11237 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-inf2 9679 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-oadd 8518 df-omul 8519 df-er 8755 df-ec 8757 df-qs 8761 df-wun 10826 df-ni 10996 df-pli 10997 df-mi 10998 df-lti 10999 df-plpq 11032 df-mpq 11033 df-ltpq 11034 df-enq 11035 df-nq 11036 df-erq 11037 df-plq 11038 df-mq 11039 df-1nq 11040 df-rq 11041 df-ltnq 11042 df-np 11105 df-plp 11107 df-ltp 11109 df-enr 11179 df-nr 11180 df-c 11245 |
| This theorem is used by: wunndx 17417 |
| Copyright terms: Public domain | W3C validator |