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 10877 | . 2 ⊢ ℂ = (R × R) | |
2 | wuncn.1 | . . 3 ⊢ (𝜑 → 𝑈 ∈ WUni) | |
3 | df-nr 10812 | . . . 4 ⊢ R = ((P × P) / ~R ) | |
4 | df-ni 10628 | . . . . . . . . . . . 12 ⊢ N = (ω ∖ {∅}) | |
5 | wuncn.2 | . . . . . . . . . . . . 13 ⊢ (𝜑 → ω ∈ 𝑈) | |
6 | 2, 5 | wundif 10470 | . . . . . . . . . . . 12 ⊢ (𝜑 → (ω ∖ {∅}) ∈ 𝑈) |
7 | 4, 6 | eqeltrid 2843 | . . . . . . . . . . 11 ⊢ (𝜑 → N ∈ 𝑈) |
8 | 2, 7, 7 | wunxp 10480 | . . . . . . . . . 10 ⊢ (𝜑 → (N × N) ∈ 𝑈) |
9 | elpqn 10681 | . . . . . . . . . . . 12 ⊢ (𝑥 ∈ Q → 𝑥 ∈ (N × N)) | |
10 | 9 | ssriv 3925 | . . . . . . . . . . 11 ⊢ Q ⊆ (N × N) |
11 | 10 | a1i 11 | . . . . . . . . . 10 ⊢ (𝜑 → Q ⊆ (N × N)) |
12 | 2, 8, 11 | wunss 10468 | . . . . . . . . 9 ⊢ (𝜑 → Q ∈ 𝑈) |
13 | 2, 12 | wunpw 10463 | . . . . . . . 8 ⊢ (𝜑 → 𝒫 Q ∈ 𝑈) |
14 | prpssnq 10746 | . . . . . . . . . . . 12 ⊢ (𝑥 ∈ P → 𝑥 ⊊ Q) | |
15 | 14 | pssssd 4032 | . . . . . . . . . . 11 ⊢ (𝑥 ∈ P → 𝑥 ⊆ Q) |
16 | velpw 4538 | . . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝒫 Q ↔ 𝑥 ⊆ Q) | |
17 | 15, 16 | sylibr 233 | . . . . . . . . . 10 ⊢ (𝑥 ∈ P → 𝑥 ∈ 𝒫 Q) |
18 | 17 | ssriv 3925 | . . . . . . . . 9 ⊢ P ⊆ 𝒫 Q |
19 | 18 | a1i 11 | . . . . . . . 8 ⊢ (𝜑 → P ⊆ 𝒫 Q) |
20 | 2, 13, 19 | wunss 10468 | . . . . . . 7 ⊢ (𝜑 → P ∈ 𝑈) |
21 | 2, 20, 20 | wunxp 10480 | . . . . . 6 ⊢ (𝜑 → (P × P) ∈ 𝑈) |
22 | 2, 21 | wunpw 10463 | . . . . 5 ⊢ (𝜑 → 𝒫 (P × P) ∈ 𝑈) |
23 | enrer 10819 | . . . . . . 7 ⊢ ~R Er (P × P) | |
24 | 23 | a1i 11 | . . . . . 6 ⊢ (𝜑 → ~R Er (P × P)) |
25 | 24 | qsss 8567 | . . . . 5 ⊢ (𝜑 → ((P × P) / ~R ) ⊆ 𝒫 (P × P)) |
26 | 2, 22, 25 | wunss 10468 | . . . 4 ⊢ (𝜑 → ((P × P) / ~R ) ∈ 𝑈) |
27 | 3, 26 | eqeltrid 2843 | . . 3 ⊢ (𝜑 → R ∈ 𝑈) |
28 | 2, 27, 27 | wunxp 10480 | . 2 ⊢ (𝜑 → (R × R) ∈ 𝑈) |
29 | 1, 28 | eqeltrid 2843 | 1 ⊢ (𝜑 → ℂ ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2106 ∖ cdif 3884 ⊆ wss 3887 ∅c0 4256 𝒫 cpw 4533 {csn 4561 × cxp 5587 ωcom 7712 Er wer 8495 / cqs 8497 WUnicwun 10456 Ncnpi 10600 Qcnq 10608 Pcnp 10615 ~R cer 10620 Rcnr 10621 ℂcc 10869 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-inf2 9399 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-oadd 8301 df-omul 8302 df-er 8498 df-ec 8500 df-qs 8504 df-wun 10458 df-ni 10628 df-pli 10629 df-mi 10630 df-lti 10631 df-plpq 10664 df-mpq 10665 df-ltpq 10666 df-enq 10667 df-nq 10668 df-erq 10669 df-plq 10670 df-mq 10671 df-1nq 10672 df-rq 10673 df-ltnq 10674 df-np 10737 df-plp 10739 df-ltp 10741 df-enr 10811 df-nr 10812 df-c 10877 |
This theorem is referenced by: wunndx 16896 |
Copyright terms: Public domain | W3C validator |