| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltexpri | Structured version Visualization version GIF version | ||
| Description: Proposition 9-3.5(iv) of [Gleason] p. 123. (Contributed by NM, 13-May-1996.) (Revised by Mario Carneiro, 14-Jun-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ltexpri | ⊢ (𝐴<P 𝐵 → ∃𝑥 ∈ P (𝐴 +P 𝑥) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltrelpr 10921 | . . 3 ⊢ <P ⊆ (P × P) | |
| 2 | 1 | brel 5696 | . 2 ⊢ (𝐴<P 𝐵 → (𝐴 ∈ P ∧ 𝐵 ∈ P)) |
| 3 | ltprord 10953 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 ↔ 𝐴 ⊊ 𝐵)) | |
| 4 | oveq2 7375 | . . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑤 +Q 𝑦) = (𝑤 +Q 𝑧)) | |
| 5 | 4 | eleq1d 2821 | . . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → ((𝑤 +Q 𝑦) ∈ 𝐵 ↔ (𝑤 +Q 𝑧) ∈ 𝐵)) |
| 6 | 5 | anbi2d 631 | . . . . . . . . 9 ⊢ (𝑦 = 𝑧 → ((¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵) ↔ (¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑧) ∈ 𝐵))) |
| 7 | 6 | exbidv 1923 | . . . . . . . 8 ⊢ (𝑦 = 𝑧 → (∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵) ↔ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑧) ∈ 𝐵))) |
| 8 | 7 | cbvabv 2806 | . . . . . . 7 ⊢ {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} = {𝑧 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑧) ∈ 𝐵)} |
| 9 | 8 | ltexprlem5 10963 | . . . . . 6 ⊢ ((𝐵 ∈ P ∧ 𝐴 ⊊ 𝐵) → {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} ∈ P) |
| 10 | 9 | adantll 715 | . . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} ∈ P) |
| 11 | 8 | ltexprlem6 10964 | . . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) ⊆ 𝐵) |
| 12 | 8 | ltexprlem7 10965 | . . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → 𝐵 ⊆ (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)})) |
| 13 | 11, 12 | eqssd 3939 | . . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) = 𝐵) |
| 14 | oveq2 7375 | . . . . . . 7 ⊢ (𝑥 = {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} → (𝐴 +P 𝑥) = (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)})) | |
| 15 | 14 | eqeq1d 2738 | . . . . . 6 ⊢ (𝑥 = {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} → ((𝐴 +P 𝑥) = 𝐵 ↔ (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) = 𝐵)) |
| 16 | 15 | rspcev 3564 | . . . . 5 ⊢ (({𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} ∈ P ∧ (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) = 𝐵) → ∃𝑥 ∈ P (𝐴 +P 𝑥) = 𝐵) |
| 17 | 10, 13, 16 | syl2anc 585 | . . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → ∃𝑥 ∈ P (𝐴 +P 𝑥) = 𝐵) |
| 18 | 17 | ex 412 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ⊊ 𝐵 → ∃𝑥 ∈ P (𝐴 +P 𝑥) = 𝐵)) |
| 19 | 3, 18 | sylbid 240 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 → ∃𝑥 ∈ P (𝐴 +P 𝑥) = 𝐵)) |
| 20 | 2, 19 | mpcom 38 | 1 ⊢ (𝐴<P 𝐵 → ∃𝑥 ∈ P (𝐴 +P 𝑥) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∃wex 1781 ∈ wcel 2114 {cab 2714 ∃wrex 3061 ⊊ wpss 3890 class class class wbr 5085 (class class class)co 7367 +Q cplq 10778 Pcnp 10782 +P cpp 10784 <P cltp 10786 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-inf2 9562 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-oadd 8409 df-omul 8410 df-er 8643 df-ni 10795 df-pli 10796 df-mi 10797 df-lti 10798 df-plpq 10831 df-mpq 10832 df-ltpq 10833 df-enq 10834 df-nq 10835 df-erq 10836 df-plq 10837 df-mq 10838 df-1nq 10839 df-rq 10840 df-ltnq 10841 df-np 10904 df-plp 10906 df-ltp 10908 |
| This theorem is referenced by: ltaprlem 10967 recexsrlem 11026 mulgt0sr 11028 map2psrpr 11033 |
| Copyright terms: Public domain | W3C validator |