HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem addclprlem2 3913
Description: Lemma to prove downward closure in positive real addition. Part of proof of Proposition 9-3.5 of [Gleason] p. 123.
Assertion
Ref Expression
addclprlem2 ((((APgA) ∧ (BPhB)) ∧ xQ) → (x <Q (g +Q h) → x ∈ (A +P B)))
Distinct variable group(s):   x,g,h   x,A   x,B

Proof of Theorem addclprlem2
StepHypRef Expression
1 addclprlem1 3912 . . . . 5 (((APgA) ∧ xQ) → (x <Q (g +Q h) → ((x ·Q (*Q ‘(g +Q h))) ·Q g) ∈ A))
21adantlr 310 . . . 4 ((((APgA) ∧ (BPhB)) ∧ xQ) → (x <Q (g +Q h) → ((x ·Q (*Q ‘(g +Q h))) ·Q g) ∈ A))
3 addclprlem1 3912 . . . . . 6 (((BPhB) ∧ xQ) → (x <Q (h +Q g) → ((x ·Q (*Q ‘(h +Q g))) ·Q h) ∈ B))
4 visset 1350 . . . . . . . 8 gV
5 visset 1350 . . . . . . . 8 hV
64, 5addcompq 3856 . . . . . . 7 (g +Q h) = (h +Q g)
76breq2i 2069 . . . . . 6 (x <Q (g +Q h) ↔ x <Q (h +Q g))
86fveq2i 2835 . . . . . . . . 9 (*Q ‘(g +Q h)) = (*Q ‘(h +Q g))
98opreq2i 3010 . . . . . . . 8 (x ·Q (*Q ‘(g +Q h))) = (x ·Q (*Q ‘(h +Q g)))
109opreq1i 3009 . . . . . . 7 ((x ·Q (*Q ‘(g +Q h))) ·Q h) = ((x ·Q (*Q ‘(h +Q g))) ·Q h)
1110eleq1i 1152 . . . . . 6 (((x ·Q (*Q ‘(g +Q h))) ·Q h) ∈ B ↔ ((x ·Q (*Q ‘(h +Q g))) ·Q h) ∈ B)
123, 7, 113imtr4g 426 . . . . 5 (((BPhB) ∧ xQ) → (x <Q (g +Q h) → ((x ·Q (*Q ‘(g +Q h))) ·Q h) ∈ B))
1312adantll 309 . . . 4 ((((APgA) ∧ (BPhB)) ∧ xQ) → (x <Q (g +Q h) → ((x ·Q (*Q ‘(g +Q h))) ·Q h) ∈ B))
142, 13jcad 455 . . 3 ((((APgA) ∧ (BPhB)) ∧ xQ) → (x <Q (g +Q h) → (((x ·Q (*Q ‘(g +Q h))) ·Q g) ∈ A ∧ ((x ·Q (*Q ‘(g +Q h))) ·Q h) ∈ B)))
15 pm3.26 256 . . . 4 ((((APgA) ∧ (BPhB)) ∧ xQ) → ((APgA) ∧ (BPhB)))
16 pm3.26 256 . . . . 5 ((APgA) → AP)
17 pm3.26 256 . . . . 5 ((BPhB) → BP)
1816, 17anim12i 268 . . . 4 (((APgA) ∧ (BPhB)) → (APBP))
19 df-plp 3882 . . . . 5 +P = {⟨⟨w, v⟩, u⟩∣((wPvP) ∧ u = {x∣∃ywzv x = (y +Q z)})}
2019genpprecl 3898 . . . 4 ((APBP) → ((((x ·Q (*Q ‘(g +Q h))) ·Q g) ∈ A ∧ ((x ·Q (*Q ‘(g +Q h))) ·Q h) ∈ B) → (((x ·Q (*Q ‘(g +Q h))) ·Q g) +Q ((x ·Q (*Q ‘(g +Q h))) ·Q h)) ∈ (A +P B)))
2115, 18, 203syl 21 . . 3 ((((APgA) ∧ (BPhB)) ∧ xQ) → ((((x ·Q (*Q ‘(g +Q h))) ·Q g) ∈ A ∧ ((x ·Q (*Q ‘(g +Q h))) ·Q h) ∈ B) → (((x ·Q (*Q ‘(g +Q h))) ·Q g) +Q ((x ·Q (*Q ‘(g +Q h))) ·Q h)) ∈ (A +P B)))
2214, 21syld 27 . 2 ((((APgA) ∧ (BPhB)) ∧ xQ) → (x <Q (g +Q h) → (((x ·Q (*Q ‘(g +Q h))) ·Q g) +Q ((x ·Q (*Q ‘(g +Q h))) ·Q h)) ∈ (A +P B)))
23 elprpq 3889 . . . . . . . . 9 ((APgA) → gQ)
24 elprpq 3889 . . . . . . . . 9 ((BPhB) → hQ)
2523, 24anim12i 268 . . . . . . . 8 (((APgA) ∧ (BPhB)) → (gQhQ))
26 addclpq 3852 . . . . . . . 8 ((gQhQ) → (g +Q h) ∈ Q)
27 recidpq 3865 . . . . . . . 8 ((g +Q h) ∈ Q → ((g +Q h) ·Q (*Q ‘(g +Q h))) = 1Q)
2825, 26, 273syl 21 . . . . . . 7 (((APgA) ∧ (BPhB)) → ((g +Q h) ·Q (*Q ‘(g +Q h))) = 1Q)
29 fvex 2838 . . . . . . . 8 (*Q ‘(g +Q h)) ∈ V
30 oprex 3018 . . . . . . . 8 (g +Q h) ∈ V
3129, 30mulcompq 3858 . . . . . . 7 ((*Q ‘(g +Q h)) ·Q (g +Q h)) = ((g +Q h) ·Q (*Q ‘(g +Q h)))
3228, 31syl5eq 1136 . . . . . 6 (((APgA) ∧ (BPhB)) → ((*Q ‘(g +Q h)) ·Q (g +Q h)) = 1Q)
3332opreq2d 3013 . . . . 5 (((APgA) ∧ (BPhB)) → (x ·Q ((*Q ‘(g +Q h)) ·Q (g +Q h))) = (x ·Q 1Q))
34 mulidpq 3863 . . . . 5 (xQ → (x ·Q 1Q) = x)
3533, 34sylan9eq 1144 . . . 4 ((((APgA) ∧ (BPhB)) ∧ xQ) → (x ·Q ((*Q ‘(g +Q h)) ·Q (g +Q h))) = x)
364, 5distrpq 3861 . . . . 5 ((x ·Q (*Q ‘(g +Q h))) ·Q (g +Q h)) = (((x ·Q (*Q ‘(g +Q h))) ·Q g) +Q ((x ·Q (*Q ‘(g +Q h))) ·Q h))
3729, 30mulasspq 3859 . . . . 5 ((x ·Q (*Q ‘(g +Q h))) ·Q (g +Q h)) = (x ·Q ((*Q ‘(g +Q h)) ·Q (g +Q h)))
3836, 37eqtr3 1121 . . . 4 (((x ·Q (*Q ‘(g +Q h))) ·Q g) +Q ((x ·Q (*Q ‘(g +Q h))) ·Q h)) = (x ·Q ((*Q ‘(g +Q h)) ·Q (g +Q h)))
3935, 38syl5eq 1136 . . 3 ((((APgA) ∧ (BPhB)) ∧ xQ) → (((x ·Q (*Q ‘(g +Q h))) ·Q g) +Q ((x ·Q (*Q ‘(g +Q h))) ·Q h)) = x)
4039eleq1d 1155 . 2 ((((APgA) ∧ (BPhB)) ∧ xQ) → ((((x ·Q (*Q ‘(g +Q h))) ·Q g) +Q ((x ·Q (*Q ‘(g +Q h))) ·Q h)) ∈ (A +P B) ↔ x ∈ (A +P B)))
4122, 40sylibd 177 1 ((((APgA) ∧ (BPhB)) ∧ xQ) → (x <Q (g +Q h) → x ∈ (A +P B)))
Colors of variables: wff set class
Syntax hints:   → wi 2   ∧ wa 196   = wceq 1091   ∈ wcel 1092   class class class wbr 2054   ‘cfv 2422  (class class class)co 3001  Qcnq 3773  1Qc1q 3774   +Q cplq 3775   ·Q cmq 3776  *Qcrq 3777   <Q cltq 3778  Pcnp 3779   +P cpp 3781
This theorem is referenced by:  addclpr 3914
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077  ax-reg 1078  ax-inf 1079
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ne 1192  df-ral 1205  df-rex 1206  df-reu 1207  df-rab 1208  df-v 1349  df-sbc 1441  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-pss 1494  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-int 1966  df-iun 1996  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-om 2373  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fv 2438  df-rdg 2970  df-opr 3003  df-oprab 3004  df-1o 3104  df-oadd 3106  df-omul 3107  df-er 3200  df-ec 3202  df-qs 3205  df-ni 3794  df-pli 3795  df-mi 3796  df-lti 3797  df-plpq 3829  df-mpq 3830  df-enq 3831  df-nq 3832  df-plq 3833  df-mq 3834  df-rq 3835  df-ltq 3836  df-1q 3837  df-np 3880  df-plp 3882
metamath.org