| 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 10953 | . . 3 ⊢ <P ⊆ (P × P) | |
| 2 | 1 | brel 5710 | . 2 ⊢ (𝐴<P 𝐵 → (𝐴 ∈ P ∧ 𝐵 ∈ P)) |
| 3 | ltprord 10985 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 ↔ 𝐴 ⊊ 𝐵)) | |
| 4 | oveq2 7400 | . . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑤 +Q 𝑦) = (𝑤 +Q 𝑧)) | |
| 5 | 4 | eleq1d 2846 | . . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → ((𝑤 +Q 𝑦) ∈ 𝐵 ↔ (𝑤 +Q 𝑧) ∈ 𝐵)) |
| 6 | 5 | anbi2d 639 | . . . . . . . . 9 ⊢ (𝑦 = 𝑧 → ((¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵) ↔ (¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑧) ∈ 𝐵))) |
| 7 | 6 | exbidv 1940 | . . . . . . . 8 ⊢ (𝑦 = 𝑧 → (∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵) ↔ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑧) ∈ 𝐵))) |
| 8 | 7 | cbvabv 2831 | . . . . . . 7 ⊢ {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} = {𝑧 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑧) ∈ 𝐵)} |
| 9 | 8 | ltexprlem5 10995 | . . . . . 6 ⊢ ((𝐵 ∈ P ∧ 𝐴 ⊊ 𝐵) → {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} ∈ P) |
| 10 | 9 | adantll 724 | . . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} ∈ P) |
| 11 | 8 | ltexprlem6 10996 | . . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) ⊆ 𝐵) |
| 12 | 8 | ltexprlem7 10997 | . . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → 𝐵 ⊆ (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)})) |
| 13 | 11, 12 | eqssd 3953 | . . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) = 𝐵) |
| 14 | oveq2 7400 | . . . . . . 7 ⊢ (𝑥 = {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} → (𝐴 +P 𝑥) = (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)})) | |
| 15 | 14 | eqeq1d 2763 | . . . . . 6 ⊢ (𝑥 = {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} → ((𝐴 +P 𝑥) = 𝐵 ↔ (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) = 𝐵)) |
| 16 | 15 | rspcev 3581 | . . . . 5 ⊢ (({𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} ∈ P ∧ (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) = 𝐵) → ∃𝑥 ∈ P (𝐴 +P 𝑥) = 𝐵) |
| 17 | 10, 13, 16 | syl2anc 593 | . . . 4 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → ∃𝑥 ∈ P (𝐴 +P 𝑥) = 𝐵) |
| 18 | 17 | ex 416 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 ⊊ 𝐵 → ∃𝑥 ∈ P (𝐴 +P 𝑥) = 𝐵)) |
| 19 | 3, 18 | sylbid 242 | . 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 399 = wceq 1559 ∃wex 1798 ∈ wcel 2141 {cab 2739 ∃wrex 3085 ⊊ wpss 3905 class class class wbr 5099 (class class class)co 7392 +Q cplq 10810 Pcnp 10814 +P cpp 10816 <P cltp 10818 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-inf2 9593 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-oadd 8436 df-omul 8437 df-er 8673 df-ni 10827 df-pli 10828 df-mi 10829 df-lti 10830 df-plpq 10863 df-mpq 10864 df-ltpq 10865 df-enq 10866 df-nq 10867 df-erq 10868 df-plq 10869 df-mq 10870 df-1nq 10871 df-rq 10872 df-ltnq 10873 df-np 10936 df-plp 10938 df-ltp 10940 |
| This theorem is referenced by: ltaprlem 10999 recexsrlem 11058 mulgt0sr 11060 map2psrpr 11065 |
| Copyright terms: Public domain | W3C validator |