| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > addlocprlemeq | GIF version | ||
| Description: Lemma for addlocpr 7734. 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 7730 | . . . . 5 ⊢ (𝜑 → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃))) |
| 13 | 12 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → (𝑈 +Q 𝑇) <Q ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃))) |
| 14 | oveq1 6014 | . . . . 5 ⊢ (𝑄 = (𝐷 +Q 𝐸) → (𝑄 +Q (𝑃 +Q 𝑃)) = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃))) | |
| 15 | 5, 14 | sylan9req 2283 | . . . 4 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → 𝑅 = ((𝐷 +Q 𝐸) +Q (𝑃 +Q 𝑃))) |
| 16 | 13, 15 | breqtrrd 4111 | . . 3 ⊢ ((𝜑 ∧ 𝑄 = (𝐷 +Q 𝐸)) → (𝑈 +Q 𝑇) <Q 𝑅) |
| 17 | 1, 7 | jca 306 | . . . . 5 ⊢ (𝜑 → (𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴))) |
| 18 | 2, 10 | jca 306 | . . . . 5 ⊢ (𝜑 → (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵))) |
| 19 | ltrelnq 7563 | . . . . . . . 8 ⊢ <Q ⊆ (Q × Q) | |
| 20 | 19 | brel 4771 | . . . . . . 7 ⊢ (𝑄 <Q 𝑅 → (𝑄 ∈ Q ∧ 𝑅 ∈ Q)) |
| 21 | 20 | simprd 114 | . . . . . 6 ⊢ (𝑄 <Q 𝑅 → 𝑅 ∈ Q) |
| 22 | 3, 21 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Q) |
| 23 | addnqpru 7728 | . . . . 5 ⊢ ((((𝐴 ∈ P ∧ 𝑈 ∈ (2nd ‘𝐴)) ∧ (𝐵 ∈ P ∧ 𝑇 ∈ (2nd ‘𝐵))) ∧ 𝑅 ∈ Q) → ((𝑈 +Q 𝑇) <Q 𝑅 → 𝑅 ∈ (2nd ‘(𝐴 +P 𝐵)))) | |
| 24 | 17, 18, 22, 23 | syl21anc 1270 | . . . 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 1395 ∈ wcel 2200 class class class wbr 4083 ‘cfv 5318 (class class class)co 6007 1st c1st 6290 2nd c2nd 6291 Qcnq 7478 +Q cplq 7480 <Q cltq 7483 Pcnp 7489 +P cpp 7491 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-eprel 4380 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-irdg 6522 df-1o 6568 df-oadd 6572 df-omul 6573 df-er 6688 df-ec 6690 df-qs 6694 df-ni 7502 df-pli 7503 df-mi 7504 df-lti 7505 df-plpq 7542 df-mpq 7543 df-enq 7545 df-nqqs 7546 df-plqqs 7547 df-mqqs 7548 df-1nqqs 7549 df-rq 7550 df-ltnqqs 7551 df-inp 7664 df-iplp 7666 |
| This theorem is referenced by: addlocprlem 7733 |
| Copyright terms: Public domain | W3C validator |