| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > addlocprlemeq | GIF version | ||
| Description: Lemma for addlocpr 7755. The 𝑄 = (𝐷 +Q 𝐸) case. (Contributed by Jim Kingdon, 6-Dec-2019.) |
| Ref | Expression |
|---|---|
| addlocprlem.a | ⊢ (𝜑 → 𝐴 ∈ P) |
| addlocprlem.b | ⊢ (𝜑 → 𝐵 ∈ P) |
| addlocprlem.qr | ⊢ (𝜑 → 𝑄 <Q 𝑅) |
| addlocprlem.p | ⊢ (𝜑 → 𝑃 ∈ Q) |
| addlocprlem.qppr | ⊢ (𝜑 → (𝑄 +Q (𝑃 +Q 𝑃)) = 𝑅) |
| addlocprlem.dlo | ⊢ (𝜑 → 𝐷 ∈ (1st ‘𝐴)) |
| addlocprlem.uup | ⊢ (𝜑 → 𝑈 ∈ (2nd ‘𝐴)) |
| addlocprlem.du | ⊢ (𝜑 → 𝑈 <Q (𝐷 +Q 𝑃)) |
| addlocprlem.elo | ⊢ (𝜑 → 𝐸 ∈ (1st ‘𝐵)) |
| addlocprlem.tup | ⊢ (𝜑 → 𝑇 ∈ (2nd ‘𝐵)) |
| addlocprlem.et | ⊢ (𝜑 → 𝑇 <Q (𝐸 +Q 𝑃)) |
| Ref | Expression |
|---|---|
| addlocprlemeq | ⊢ (𝜑 → (𝑄 = (𝐷 +Q 𝐸) → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | addlocprlem.a | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ P) | |
| 2 | addlocprlem.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ P) | |
| 3 | addlocprlem.qr | . . . . . 6 ⊢ (𝜑 → 𝑄 <Q 𝑅) | |
| 4 | addlocprlem.p | . . . . . 6 ⊢ (𝜑 → 𝑃 ∈ Q) | |
| 5 | addlocprlem.qppr | . . . . . 6 ⊢ (𝜑 → (𝑄 +Q (𝑃 +Q 𝑃)) = 𝑅) | |
| 6 | addlocprlem.dlo | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (1st ‘𝐴)) | |
| 7 | addlocprlem.uup | . . . . . 6 ⊢ (𝜑 → 𝑈 ∈ (2nd ‘𝐴)) | |
| 8 | addlocprlem.du | . . . . . 6 ⊢ (𝜑 → 𝑈 <Q (𝐷 +Q 𝑃)) | |
| 9 | addlocprlem.elo | . . . . . 6 ⊢ (𝜑 → 𝐸 ∈ (1st ‘𝐵)) | |
| 10 | addlocprlem.tup | . . . . . 6 ⊢ (𝜑 → 𝑇 ∈ (2nd ‘𝐵)) | |
| 11 | addlocprlem.et | . . . . . 6 ⊢ (𝜑 → 𝑇 <Q (𝐸 +Q 𝑃)) | |
| 12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 | addlocprlemeqgt 7751 | . . . . 5 ⊢ (𝜑 → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃))) |
| 13 | 12 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃))) |
| 14 | oveq1 6024 | . . . . 5 ⊢ (𝑄 = (𝐷 +Q 𝐸) → (𝑄 +Q (𝑃 +Q 𝑃)) = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃))) | |
| 15 | 5, 14 | sylan9req 2285 | . . . 4 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → 𝑅 = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃))) |
| 16 | 13, 15 | breqtrrd 4116 | . . 3 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → (𝑈 +Q 𝑇) <Q 𝑅) |
| 17 | 1, 7 | jca 306 | . . . . 5 ⊢ (𝜑 → (𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴))) |
| 18 | 2, 10 | jca 306 | . . . . 5 ⊢ (𝜑 → (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵))) |
| 19 | ltrelnq 7584 | . . . . . . . 8 ⊢ <Q ⊆ (Q × Q) | |
| 20 | 19 | brel 4778 | . . . . . . 7 ⊢ (𝑄 <Q 𝑅 → (𝑄 ∈ Q ∧ 𝑅 ∈ Q)) |
| 21 | 20 | simprd 114 | . . . . . 6 ⊢ (𝑄 <Q 𝑅 → 𝑅 ∈ Q) |
| 22 | 3, 21 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Q) |
| 23 | addnqpru 7749 | . . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵))) ∧ 𝑅 ∈ Q) → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵)))) | |
| 24 | 17, 18, 22, 23 | syl21anc 1272 | . . . 4 ⊢ (𝜑 → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵)))) |
| 25 | 24 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵)))) |
| 26 | 16, 25 | mpd 13 | . 2 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵))) |
| 27 | 26 | ex 115 | 1 ⊢ (𝜑 → (𝑄 = (𝐷 +Q 𝐸) → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2202 class class class wbr 4088 ‘cfv 5326 (class class class)co 6017 1st c1st 6300 2nd c2nd 6301 Qcnq 7499 +Q cplq 7501 <Q cltq 7504 Pcnp 7510 +P cpp 7512 |
| 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-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 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-ne 2403 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-nul 3495 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-tr 4188 df-eprel 4386 df-id 4390 df-po 4393 df-iso 4394 df-iord 4463 df-on 4465 df-suc 4468 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 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-recs 6470 df-irdg 6535 df-1o 6581 df-oadd 6585 df-omul 6586 df-er 6701 df-ec 6703 df-qs 6707 df-ni 7523 df-pli 7524 df-mi 7525 df-lti 7526 df-plpq 7563 df-mpq 7564 df-enq 7566 df-nqqs 7567 df-plqqs 7568 df-mqqs 7569 df-1nqqs 7570 df-rq 7571 df-ltnqqs 7572 df-inp 7685 df-iplp 7687 |
| This theorem is referenced by: addlocprlem 7754 |
| Copyright terms: Public domain | W3C validator |