Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ltexprlem3 | Structured version Visualization version GIF version |
Description: Lemma for Proposition 9-3.5(iv) of [Gleason] p. 123. (Contributed by NM, 6-Apr-1996.) (New usage is discouraged.) |
Ref | Expression |
---|---|
ltexprlem.1 | ⊢ 𝐶 = {𝑥 ∣ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)} |
Ref | Expression |
---|---|
ltexprlem3 | ⊢ (𝐵 ∈ P → (𝑥 ∈ 𝐶 → ∀𝑧(𝑧 <Q 𝑥 → 𝑧 ∈ 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elprnq 10747 | . . . . . . . . . 10 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑦 +Q 𝑥) ∈ Q) | |
2 | addnqf 10704 | . . . . . . . . . . . . 13 ⊢ +Q :(Q × Q)⟶Q | |
3 | 2 | fdmi 6612 | . . . . . . . . . . . 12 ⊢ dom +Q = (Q × Q) |
4 | 0nnq 10680 | . . . . . . . . . . . 12 ⊢ ¬ ∅ ∈ Q | |
5 | 3, 4 | ndmovrcl 7458 | . . . . . . . . . . 11 ⊢ ((𝑦 +Q 𝑥) ∈ Q → (𝑦 ∈ Q ∧ 𝑥 ∈ Q)) |
6 | 5 | simpld 495 | . . . . . . . . . 10 ⊢ ((𝑦 +Q 𝑥) ∈ Q → 𝑦 ∈ Q) |
7 | ltanq 10727 | . . . . . . . . . 10 ⊢ (𝑦 ∈ Q → (𝑧 <Q 𝑥 ↔ (𝑦 +Q 𝑧) <Q (𝑦 +Q 𝑥))) | |
8 | 1, 6, 7 | 3syl 18 | . . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑧 <Q 𝑥 ↔ (𝑦 +Q 𝑧) <Q (𝑦 +Q 𝑥))) |
9 | prcdnq 10749 | . . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → ((𝑦 +Q 𝑧) <Q (𝑦 +Q 𝑥) → (𝑦 +Q 𝑧) ∈ 𝐵)) | |
10 | 8, 9 | sylbid 239 | . . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑧 <Q 𝑥 → (𝑦 +Q 𝑧) ∈ 𝐵)) |
11 | 10 | impancom 452 | . . . . . . 7 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → ((𝑦 +Q 𝑥) ∈ 𝐵 → (𝑦 +Q 𝑧) ∈ 𝐵)) |
12 | 11 | anim2d 612 | . . . . . 6 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → ((¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
13 | 12 | eximdv 1920 | . . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → (∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
14 | ltexprlem.1 | . . . . . 6 ⊢ 𝐶 = {𝑥 ∣ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)} | |
15 | 14 | abeq2i 2875 | . . . . 5 ⊢ (𝑥 ∈ 𝐶 ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)) |
16 | vex 3436 | . . . . . 6 ⊢ 𝑧 ∈ V | |
17 | oveq2 7283 | . . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑦 +Q 𝑥) = (𝑦 +Q 𝑧)) | |
18 | 17 | eleq1d 2823 | . . . . . . . 8 ⊢ (𝑥 = 𝑧 → ((𝑦 +Q 𝑥) ∈ 𝐵 ↔ (𝑦 +Q 𝑧) ∈ 𝐵)) |
19 | 18 | anbi2d 629 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → ((¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) ↔ (¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
20 | 19 | exbidv 1924 | . . . . . 6 ⊢ (𝑥 = 𝑧 → (∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
21 | 16, 20, 14 | elab2 3613 | . . . . 5 ⊢ (𝑧 ∈ 𝐶 ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵)) |
22 | 13, 15, 21 | 3imtr4g 296 | . . . 4 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → (𝑥 ∈ 𝐶 → 𝑧 ∈ 𝐶)) |
23 | 22 | ex 413 | . . 3 ⊢ (𝐵 ∈ P → (𝑧 <Q 𝑥 → (𝑥 ∈ 𝐶 → 𝑧 ∈ 𝐶))) |
24 | 23 | com23 86 | . 2 ⊢ (𝐵 ∈ P → (𝑥 ∈ 𝐶 → (𝑧 <Q 𝑥 → 𝑧 ∈ 𝐶))) |
25 | 24 | alrimdv 1932 | 1 ⊢ (𝐵 ∈ P → (𝑥 ∈ 𝐶 → ∀𝑧(𝑧 <Q 𝑥 → 𝑧 ∈ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∀wal 1537 = wceq 1539 ∃wex 1782 ∈ wcel 2106 {cab 2715 class class class wbr 5074 × cxp 5587 (class class class)co 7275 Qcnq 10608 +Q cplq 10611 <Q cltq 10614 Pcnp 10615 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-oadd 8301 df-omul 8302 df-er 8498 df-ni 10628 df-pli 10629 df-mi 10630 df-lti 10631 df-plpq 10664 df-ltpq 10666 df-enq 10667 df-nq 10668 df-erq 10669 df-plq 10670 df-1nq 10672 df-ltnq 10674 df-np 10737 |
This theorem is referenced by: ltexprlem5 10796 |
Copyright terms: Public domain | W3C validator |