| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > addassprg | GIF version | ||
| Description: Addition of positive reals is associative. Proposition 9-3.5(i) of [Gleason] p. 123. (Contributed by Jim Kingdon, 11-Dec-2019.) |
| Ref | Expression |
|---|---|
| addassprg | ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝐴 +P 𝐵) +P 𝐶) = (𝐴 +P (𝐵 +P 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-iplp 7623 | . 2 ⊢ +P = (𝑤 ∈ P, 𝑣 ∈ P ↦ 〈{𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (1st ‘𝑤) ∧ 𝑧 ∈ (1st ‘𝑣) ∧ 𝑥 = (𝑦 +Q 𝑧))}, {𝑥 ∈ Q ∣ ∃𝑦 ∈ Q ∃𝑧 ∈ Q (𝑦 ∈ (2nd ‘𝑤) ∧ 𝑧 ∈ (2nd ‘𝑣) ∧ 𝑥 = (𝑦 +Q 𝑧))}〉) | |
| 2 | addclnq 7530 | . 2 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦 +Q 𝑧) ∈ Q) | |
| 3 | dmplp 7695 | . 2 ⊢ dom +P = (P × P) | |
| 4 | addclpr 7692 | . 2 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓 +P 𝑔) ∈ P) | |
| 5 | addassnqg 7537 | . 2 ⊢ ((𝑓 ∈ Q ∧ 𝑔 ∈ Q ∧ ℎ ∈ Q) → ((𝑓 +Q 𝑔) +Q ℎ) = (𝑓 +Q (𝑔 +Q ℎ))) | |
| 6 | 1, 2, 3, 4, 5 | genpassg 7681 | 1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P ∧ 𝐶 ∈ P) → ((𝐴 +P 𝐵) +P 𝐶) = (𝐴 +P (𝐵 +P 𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 983 = wceq 1375 ∈ wcel 2180 (class class class)co 5974 +Q cplq 7437 Pcnp 7446 +P cpp 7448 |
| 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 617 ax-in2 618 ax-io 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-coll 4178 ax-sep 4181 ax-nul 4189 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-setind 4606 ax-iinf 4657 |
| This theorem depends on definitions: df-bi 117 df-dc 839 df-3or 984 df-3an 985 df-tru 1378 df-fal 1381 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ne 2381 df-ral 2493 df-rex 2494 df-reu 2495 df-rab 2497 df-v 2781 df-sbc 3009 df-csb 3105 df-dif 3179 df-un 3181 df-in 3183 df-ss 3190 df-nul 3472 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-int 3903 df-iun 3946 df-br 4063 df-opab 4125 df-mpt 4126 df-tr 4162 df-eprel 4357 df-id 4361 df-po 4364 df-iso 4365 df-iord 4434 df-on 4436 df-suc 4439 df-iom 4660 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-ima 4709 df-iota 5254 df-fun 5296 df-fn 5297 df-f 5298 df-f1 5299 df-fo 5300 df-f1o 5301 df-fv 5302 df-ov 5977 df-oprab 5978 df-mpo 5979 df-1st 6256 df-2nd 6257 df-recs 6421 df-irdg 6486 df-1o 6532 df-2o 6533 df-oadd 6536 df-omul 6537 df-er 6650 df-ec 6652 df-qs 6656 df-ni 7459 df-pli 7460 df-mi 7461 df-lti 7462 df-plpq 7499 df-mpq 7500 df-enq 7502 df-nqqs 7503 df-plqqs 7504 df-mqqs 7505 df-1nqqs 7506 df-rq 7507 df-ltnqqs 7508 df-enq0 7579 df-nq0 7580 df-0nq0 7581 df-plq0 7582 df-mq0 7583 df-inp 7621 df-iplp 7623 |
| This theorem is referenced by: ltaprlem 7773 ltaprg 7774 caucvgprlemcanl 7799 caucvgprprlemexb 7862 caucvgprprlemaddq 7863 enrer 7890 addcmpblnr 7894 mulcmpblnrlemg 7895 ltsrprg 7902 addasssrg 7911 mulasssrg 7913 distrsrg 7914 m1p1sr 7915 m1m1sr 7916 lttrsr 7917 ltsosr 7919 0idsr 7922 1idsr 7923 ltasrg 7925 recexgt0sr 7928 mulgt0sr 7933 mulextsr1lem 7935 srpospr 7938 prsradd 7941 prsrlt 7942 map2psrprg 7960 pitonnlem1p1 8001 pitoregt0 8004 recidpirqlemcalc 8012 |
| Copyright terms: Public domain | W3C validator |