| 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 11213 | . 2 ⊢ ℂ = (R × R) | |
| 2 | wuncn.1 | . . 3 ⊢ (𝜑 → 𝑈 ∈ WUni) | |
| 3 | df-nr 11148 | . . . 4 ⊢ R = ((P × P) / ~R ) | |
| 4 | df-ni 10964 | . . . . . . . . . . . 12 ⊢ N = (ω ∖ {∅}) | |
| 5 | wuncn.2 | . . . . . . . . . . . . 13 ⊢ (𝜑 → ω ∈ 𝑈) | |
| 6 | 2, 5 | wundif 10806 | . . . . . . . . . . . 12 ⊢ (𝜑 → (ω ∖ {∅}) ∈ 𝑈) |
| 7 | 4, 6 | eqeltrid 2864 | . . . . . . . . . . 11 ⊢ (𝜑 → N ∈ 𝑈) |
| 8 | 2, 7, 7 | wunxp 10816 | . . . . . . . . . 10 ⊢ (𝜑 → (N × N) ∈ 𝑈) |
| 9 | elpqn 11017 | . . . . . . . . . . . 12 ⊢ (𝑥 ∈ Q → 𝑥 ∈ (N × N)) | |
| 10 | 9 | ssriv 3913 | . . . . . . . . . . 11 ⊢ Q ⊆ (N × N) |
| 11 | 10 | a1i 11 | . . . . . . . . . 10 ⊢ (𝜑 → Q ⊆ (N × N)) |
| 12 | 2, 8, 11 | wunss 10804 | . . . . . . . . 9 ⊢ (𝜑 → Q ∈ 𝑈) |
| 13 | 2, 12 | wunpw 10799 | . . . . . . . 8 ⊢ (𝜑 → 𝒫 Q ∈ 𝑈) |
| 14 | prpssnq 11082 | . . . . . . . . . . . 12 ⊢ (𝑥 ∈ P → 𝑥 ⊊ Q) | |
| 15 | 14 | pssssd 4026 | . . . . . . . . . . 11 ⊢ (𝑥 ∈ P → 𝑥 ⊆ Q) |
| 16 | velpw 4561 | . . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝒫 Q ↔ 𝑥 ⊆ Q) | |
| 17 | 15, 16 | sylibr 237 | . . . . . . . . . 10 ⊢ (𝑥 ∈ P → 𝑥 ∈ 𝒫 Q) |
| 18 | 17 | ssriv 3913 | . . . . . . . . 9 ⊢ P ⊆ 𝒫 Q |
| 19 | 18 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → P ⊆ 𝒫 Q) |
| 20 | 2, 13, 19 | wunss 10804 | . . . . . . 7 ⊢ (𝜑 → P ∈ 𝑈) |
| 21 | 2, 20, 20 | wunxp 10816 | . . . . . 6 ⊢ (𝜑 → (P × P) ∈ 𝑈) |
| 22 | 2, 21 | wunpw 10799 | . . . . 5 ⊢ (𝜑 → 𝒫 (P × P) ∈ 𝑈) |
| 23 | enrer 11155 | . . . . . . 7 ⊢ ~R Er (P × P) | |
| 24 | 23 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ~R Er (P × P)) |
| 25 | 24 | qsss 8803 | . . . . 5 ⊢ (𝜑 → ((P × P) / ~R ) ⊆ 𝒫 (P × P)) |
| 26 | 2, 22, 25 | wunss 10804 | . . . 4 ⊢ (𝜑 → ((P × P) / ~R ) ∈ 𝑈) |
| 27 | 3, 26 | eqeltrid 2864 | . . 3 ⊢ (𝜑 → R ∈ 𝑈) |
| 28 | 2, 27, 27 | wunxp 10816 | . 2 ⊢ (𝜑 → (R × R) ∈ 𝑈) |
| 29 | 1, 28 | eqeltrid 2864 | 1 ⊢ (𝜑 → ℂ ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2144 ⊆ wss 3896 ∖ cdif 4044 ∅c0 4277 𝒫 cpw 4556 {csn 4584 × cxp 5649 ωcom 7881 Er wer 8721 / cqs 8723 WUnicwun 10792 Ncnpi 10936 Qcnq 10944 Pcnp 10951 ~R cer 10956 Rcnr 10957 ℂcc 11205 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-inf2 9649 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8306 df-wrecs 8337 df-recs 8386 df-rdg 8425 df-1o 8483 df-oadd 8487 df-omul 8488 df-er 8724 df-ec 8726 df-qs 8730 df-wun 10794 df-ni 10964 df-pli 10965 df-mi 10966 df-lti 10967 df-plpq 11000 df-mpq 11001 df-ltpq 11002 df-enq 11003 df-nq 11004 df-erq 11005 df-plq 11006 df-mq 11007 df-1nq 11008 df-rq 11009 df-ltnq 11010 df-np 11073 df-plp 11075 df-ltp 11077 df-enr 11147 df-nr 11148 df-c 11213 |
| This theorem is used by: wunndx 17382 |
| Copyright terms: Public domain | W3C validator |