| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > addvalex | GIF version | ||
| Description: Existence of a sum. This is dependent on how we define + so once we proceed to real number axioms we will replace it with theorems such as addcl 8248. (Contributed by Jim Kingdon, 14-Jul-2021.) |
| Ref | Expression |
|---|---|
| addvalex | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 + 𝐵) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ov 6052 | . 2 ⊢ (𝐴 + 𝐵) = ( + ‘〈𝐴, 𝐵〉) | |
| 2 | df-nr 8038 | . . . . 5 ⊢ R = ((P × P) / ~R ) | |
| 3 | npex 7784 | . . . . . . 7 ⊢ P ∈ V | |
| 4 | 3, 3 | xpex 4865 | . . . . . 6 ⊢ (P × P) ∈ V |
| 5 | 4 | qsex 6825 | . . . . 5 ⊢ ((P × P) / ~R ) ∈ V |
| 6 | 2, 5 | eqeltri 2305 | . . . 4 ⊢ R ∈ V |
| 7 | df-add 8134 | . . . . 5 ⊢ + = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 〈(𝑤 +R 𝑢), (𝑣 +R 𝑓)〉))} | |
| 8 | df-c 8129 | . . . . . . . . 9 ⊢ ℂ = (R × R) | |
| 9 | 8 | eleq2i 2299 | . . . . . . . 8 ⊢ (𝑥 ∈ ℂ ↔ 𝑥 ∈ (R × R)) |
| 10 | 8 | eleq2i 2299 | . . . . . . . 8 ⊢ (𝑦 ∈ ℂ ↔ 𝑦 ∈ (R × R)) |
| 11 | 9, 10 | anbi12i 460 | . . . . . . 7 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ↔ (𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R))) |
| 12 | 11 | anbi1i 458 | . . . . . 6 ⊢ (((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 〈(𝑤 +R 𝑢), (𝑣 +R 𝑓)〉)) ↔ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 〈(𝑤 +R 𝑢), (𝑣 +R 𝑓)〉))) |
| 13 | 12 | oprabbii 6107 | . . . . 5 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 〈(𝑤 +R 𝑢), (𝑣 +R 𝑓)〉))} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 〈(𝑤 +R 𝑢), (𝑣 +R 𝑓)〉))} |
| 14 | 7, 13 | eqtri 2253 | . . . 4 ⊢ + = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 〈(𝑤 +R 𝑢), (𝑣 +R 𝑓)〉))} |
| 15 | 6, 14 | oprabex3 6321 | . . 3 ⊢ + ∈ V |
| 16 | opexg 4343 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 ∈ V) | |
| 17 | fvexg 5688 | . . 3 ⊢ (( + ∈ V ∧ 〈𝐴, 𝐵〉 ∈ V) → ( + ‘〈𝐴, 𝐵〉) ∈ V) | |
| 18 | 15, 16, 17 | sylancr 414 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ( + ‘〈𝐴, 𝐵〉) ∈ V) |
| 19 | 1, 18 | eqeltrid 2319 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 + 𝐵) ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∃wex 1541 ∈ wcel 2203 Vcvv 2812 〈cop 3691 × cxp 4746 ‘cfv 5351 (class class class)co 6049 {coprab 6050 / cqs 6765 Pcnp 7602 ~R cer 7607 Rcnr 7608 +R cplr 7612 ℂcc 8121 + caddc 8126 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-iinf 4709 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-ov 6052 df-oprab 6053 df-qs 6772 df-ni 7615 df-nqqs 7659 df-inp 7777 df-nr 8038 df-c 8129 df-add 8134 |
| This theorem is referenced by: peano2nnnn 8164 |
| Copyright terms: Public domain | W3C validator |