| 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 8157. (Contributed by Jim Kingdon, 14-Jul-2021.) |
| Ref | Expression |
|---|---|
| addvalex | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 + 𝐵) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ov 6021 | . 2 ⊢ (𝐴 + 𝐵) = ( + ‘〈𝐴, 𝐵〉) | |
| 2 | df-nr 7947 | . . . . 5 ⊢ R = ((P × P) / ~R ) | |
| 3 | npex 7693 | . . . . . . 7 ⊢ P ∈ V | |
| 4 | 3, 3 | xpex 4842 | . . . . . 6 ⊢ (P × P) ∈ V |
| 5 | 4 | qsex 6761 | . . . . 5 ⊢ ((P × P) / ~R ) ∈ V |
| 6 | 2, 5 | eqeltri 2304 | . . . 4 ⊢ R ∈ V |
| 7 | df-add 8043 | . . . . 5 ⊢ + = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 〈(𝑤 +R 𝑢), (𝑣 +R 𝑓)〉))} | |
| 8 | df-c 8038 | . . . . . . . . 9 ⊢ ℂ = (R × R) | |
| 9 | 8 | eleq2i 2298 | . . . . . . . 8 ⊢ (𝑥 ∈ ℂ ↔ 𝑥 ∈ (R × R)) |
| 10 | 8 | eleq2i 2298 | . . . . . . . 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 6076 | . . . . 5 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 〈(𝑤 +R 𝑢), (𝑣 +R 𝑓)〉))} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 〈(𝑤 +R 𝑢), (𝑣 +R 𝑓)〉))} |
| 14 | 7, 13 | eqtri 2252 | . . . 4 ⊢ + = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ (R × R) ∧ 𝑦 ∈ (R × R)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = 〈𝑤, 𝑣〉 ∧ 𝑦 = 〈𝑢, 𝑓〉) ∧ 𝑧 = 〈(𝑤 +R 𝑢), (𝑣 +R 𝑓)〉))} |
| 15 | 6, 14 | oprabex3 6291 | . . 3 ⊢ + ∈ V |
| 16 | opexg 4320 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 ∈ V) | |
| 17 | fvexg 5658 | . . 3 ⊢ (( + ∈ V ∧ 〈𝐴, 𝐵〉 ∈ V) → ( + ‘〈𝐴, 𝐵〉) ∈ V) | |
| 18 | 15, 16, 17 | sylancr 414 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ( + ‘〈𝐴, 𝐵〉) ∈ V) |
| 19 | 1, 18 | eqeltrid 2318 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 + 𝐵) ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∃wex 1540 ∈ wcel 2202 Vcvv 2802 〈cop 3672 × cxp 4723 ‘cfv 5326 (class class class)co 6018 {coprab 6019 / cqs 6701 Pcnp 7511 ~R cer 7516 Rcnr 7517 +R cplr 7521 ℂcc 8030 + caddc 8035 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-iinf 4686 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-ov 6021 df-oprab 6022 df-qs 6708 df-ni 7524 df-nqqs 7568 df-inp 7686 df-nr 7947 df-c 8038 df-add 8043 |
| This theorem is referenced by: peano2nnnn 8073 |
| Copyright terms: Public domain | W3C validator |