| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltexprlem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for Proposition 9-3.5(iv) of [Gleason] p. 123. (Contributed by NM, 3-Apr-1996.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ltexprlem.1 | ⊢ 𝐶 = {𝑥 ∣ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)} |
| Ref | Expression |
|---|---|
| ltexprlem2 | ⊢ (𝐵 ∈ P → 𝐶 ⊊ Q) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltexprlem.1 | . . . . 5 ⊢ 𝐶 = {𝑥 ∣ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)} | |
| 2 | 1 | eqabri 2907 | . . . 4 ⊢ (𝑥 ∈ 𝐶 ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)) |
| 3 | elprnq 10987 | . . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑦 +Q 𝑥) ∈ Q) | |
| 4 | addnqf 10944 | . . . . . . . . . . 11 ⊢ +Q :(Q × Q)⟶Q | |
| 5 | 4 | fdmi 6721 | . . . . . . . . . 10 ⊢ dom +Q = (Q × Q) |
| 6 | 0nnq 10920 | . . . . . . . . . 10 ⊢ ¬ ∅ ∈ Q | |
| 7 | 5, 6 | ndmovrcl 7602 | . . . . . . . . 9 ⊢ ((𝑦 +Q 𝑥) ∈ Q → (𝑦 ∈ Q ∧ 𝑥 ∈ Q)) |
| 8 | 3, 7 | syl 18 | . . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑦 ∈ Q ∧ 𝑥 ∈ Q)) |
| 9 | ltaddnq 10970 | . . . . . . . . . . 11 ⊢ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) → 𝑥 <Q (𝑥 +Q 𝑦)) | |
| 10 | 9 | ancoms 464 | . . . . . . . . . 10 ⊢ ((𝑦 ∈ Q ∧ 𝑥 ∈ Q) → 𝑥 <Q (𝑥 +Q 𝑦)) |
| 11 | addcomnq 10947 | . . . . . . . . . 10 ⊢ (𝑥 +Q 𝑦) = (𝑦 +Q 𝑥) | |
| 12 | 10, 11 | breqtrdi 5154 | . . . . . . . . 9 ⊢ ((𝑦 ∈ Q ∧ 𝑥 ∈ Q) → 𝑥 <Q (𝑦 +Q 𝑥)) |
| 13 | prcdnq 10989 | . . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑥 <Q (𝑦 +Q 𝑥) → 𝑥 ∈ 𝐵)) | |
| 14 | 12, 13 | syl5 35 | . . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → ((𝑦 ∈ Q ∧ 𝑥 ∈ Q) → 𝑥 ∈ 𝐵)) |
| 15 | 8, 14 | mpd 16 | . . . . . . 7 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → 𝑥 ∈ 𝐵) |
| 16 | 15 | ex 418 | . . . . . 6 ⊢ (𝐵 ∈ P → ((𝑦 +Q 𝑥) ∈ 𝐵 → 𝑥 ∈ 𝐵)) |
| 17 | 16 | adantld 496 | . . . . 5 ⊢ (𝐵 ∈ P → ((¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → 𝑥 ∈ 𝐵)) |
| 18 | 17 | exlimdv 1966 | . . . 4 ⊢ (𝐵 ∈ P → (∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → 𝑥 ∈ 𝐵)) |
| 19 | 2, 18 | biimtrid 245 | . . 3 ⊢ (𝐵 ∈ P → (𝑥 ∈ 𝐶 → 𝑥 ∈ 𝐵)) |
| 20 | 19 | ssrdv 3944 | . 2 ⊢ (𝐵 ∈ P → 𝐶 ⊆ 𝐵) |
| 21 | prpssnq 10986 | . 2 ⊢ (𝐵 ∈ P → 𝐵 ⊊ Q) | |
| 22 | 20, 21 | sspsstrd 4067 | 1 ⊢ (𝐵 ∈ P → 𝐶 ⊊ Q) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2146 {cab 2743 ⊊ wpss 3907 class class class wbr 5111 × cxp 5661 (class class class)co 7416 Qcnq 10848 +Q cplq 10851 <Q cltq 10854 Pcnp 10855 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 ax-un 7738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-oadd 8459 df-omul 8460 df-er 8696 df-ni 10868 df-pli 10869 df-mi 10870 df-lti 10871 df-plpq 10904 df-mpq 10905 df-ltpq 10906 df-enq 10907 df-nq 10908 df-erq 10909 df-plq 10910 df-mq 10911 df-1nq 10912 df-ltnq 10914 df-np 10977 |
| This theorem is used by: ltexprlem5 11036 |
| Copyright terms: Public domain | W3C validator |