| 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 10909 | . . 3 ⊢ <P ⊆ (P × P) | |
| 2 | 1 | brel 5689 | . 2 ⊢ (𝐴<P 𝐵 → (𝐴 ∈ P ∧ 𝐵 ∈ P)) |
| 3 | ltprord 10941 | . . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 ↔ 𝐴 ⊊ 𝐵)) | |
| 4 | oveq2 7366 | . . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑤 +Q 𝑦) = (𝑤 +Q 𝑧)) | |
| 5 | 4 | eleq1d 2821 | . . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → ((𝑤 +Q 𝑦) ∈ 𝐵 ↔ (𝑤 +Q 𝑧) ∈ 𝐵)) |
| 6 | 5 | anbi2d 630 | . . . . . . . . 9 ⊢ (𝑦 = 𝑧 → ((¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵) ↔ (¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑧) ∈ 𝐵))) |
| 7 | 6 | exbidv 1922 | . . . . . . . 8 ⊢ (𝑦 = 𝑧 → (∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵) ↔ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑧) ∈ 𝐵))) |
| 8 | 7 | cbvabv 2806 | . . . . . . 7 ⊢ {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} = {𝑧 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑧) ∈ 𝐵)} |
| 9 | 8 | ltexprlem5 10951 | . . . . . 6 ⊢ ((𝐵 ∈ P ∧ 𝐴 ⊊ 𝐵) → {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} ∈ P) |
| 10 | 9 | adantll 714 | . . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} ∈ P) |
| 11 | 8 | ltexprlem6 10952 | . . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) ⊆ 𝐵) |
| 12 | 8 | ltexprlem7 10953 | . . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → 𝐵 ⊆ (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)})) |
| 13 | 11, 12 | eqssd 3951 | . . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ 𝐴 ⊊ 𝐵) → (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) = 𝐵) |
| 14 | oveq2 7366 | . . . . . . 7 ⊢ (𝑥 = {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} → (𝐴 +P 𝑥) = (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)})) | |
| 15 | 14 | eqeq1d 2738 | . . . . . 6 ⊢ (𝑥 = {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} → ((𝐴 +P 𝑥) = 𝐵 ↔ (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) = 𝐵)) |
| 16 | 15 | rspcev 3576 | . . . . 5 ⊢ (({𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)} ∈ P ∧ (𝐴 +P {𝑦 ∣ ∃𝑤(¬ 𝑤 ∈ 𝐴 ∧ (𝑤 +Q 𝑦) ∈ 𝐵)}) = 𝐵) → ∃𝑥 ∈ P (𝐴 +P 𝑥) = 𝐵) |
| 17 | 10, 13, 16 | syl2anc 584 | . . . 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 1541 ∃wex 1780 ∈ wcel 2113 {cab 2714 ∃wrex 3060 ⊊ wpss 3902 class class class wbr 5098 (class class class)co 7358 +Q cplq 10766 Pcnp 10770 +P cpp 10772 <P cltp 10774 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-inf2 9550 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-oadd 8401 df-omul 8402 df-er 8635 df-ni 10783 df-pli 10784 df-mi 10785 df-lti 10786 df-plpq 10819 df-mpq 10820 df-ltpq 10821 df-enq 10822 df-nq 10823 df-erq 10824 df-plq 10825 df-mq 10826 df-1nq 10827 df-rq 10828 df-ltnq 10829 df-np 10892 df-plp 10894 df-ltp 10896 |
| This theorem is referenced by: ltaprlem 10955 recexsrlem 11014 mulgt0sr 11016 map2psrpr 11021 |
| Copyright terms: Public domain | W3C validator |