![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > opelcn | Structured version Visualization version GIF version |
Description: Ordered pair membership in the class of complex numbers. (Contributed by NM, 14-May-1996.) (New usage is discouraged.) |
Ref | Expression |
---|---|
opelcn | ⊢ (〈𝐴, 𝐵〉 ∈ ℂ ↔ (𝐴 ∈ R ∧ 𝐵 ∈ R)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-c 10532 | . . 3 ⊢ ℂ = (R × R) | |
2 | 1 | eleq2i 2881 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ ℂ ↔ 〈𝐴, 𝐵〉 ∈ (R × R)) |
3 | opelxp 5555 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (R × R) ↔ (𝐴 ∈ R ∧ 𝐵 ∈ R)) | |
4 | 2, 3 | bitri 278 | 1 ⊢ (〈𝐴, 𝐵〉 ∈ ℂ ↔ (𝐴 ∈ R ∧ 𝐵 ∈ R)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∈ wcel 2111 〈cop 4531 × cxp 5517 Rcnr 10276 ℂcc 10524 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-opab 5093 df-xp 5525 df-c 10532 |
This theorem is referenced by: axicn 10561 |
Copyright terms: Public domain | W3C validator |