![]() |
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 11029 | . . . . . . . . . 10 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑦 +Q 𝑥) ∈ Q) | |
2 | addnqf 10986 | . . . . . . . . . . . . 13 ⊢ +Q :(Q × Q)⟶Q | |
3 | 2 | fdmi 6748 | . . . . . . . . . . . 12 ⊢ dom +Q = (Q × Q) |
4 | 0nnq 10962 | . . . . . . . . . . . 12 ⊢ ¬ ∅ ∈ Q | |
5 | 3, 4 | ndmovrcl 7619 | . . . . . . . . . . 11 ⊢ ((𝑦 +Q 𝑥) ∈ Q → (𝑦 ∈ Q ∧ 𝑥 ∈ Q)) |
6 | 5 | simpld 494 | . . . . . . . . . 10 ⊢ ((𝑦 +Q 𝑥) ∈ Q → 𝑦 ∈ Q) |
7 | ltanq 11009 | . . . . . . . . . 10 ⊢ (𝑦 ∈ Q → (𝑧 <Q 𝑥 ↔ (𝑦 +Q 𝑧) <Q (𝑦 +Q 𝑥))) | |
8 | 1, 6, 7 | 3syl 18 | . . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑧 <Q 𝑥 ↔ (𝑦 +Q 𝑧) <Q (𝑦 +Q 𝑥))) |
9 | prcdnq 11031 | . . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → ((𝑦 +Q 𝑧) <Q (𝑦 +Q 𝑥) → (𝑦 +Q 𝑧) ∈ 𝐵)) | |
10 | 8, 9 | sylbid 240 | . . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑧 <Q 𝑥 → (𝑦 +Q 𝑧) ∈ 𝐵)) |
11 | 10 | impancom 451 | . . . . . . 7 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → ((𝑦 +Q 𝑥) ∈ 𝐵 → (𝑦 +Q 𝑧) ∈ 𝐵)) |
12 | 11 | anim2d 612 | . . . . . 6 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → ((¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
13 | 12 | eximdv 1915 | . . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → (∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
14 | ltexprlem.1 | . . . . . 6 ⊢ 𝐶 = {𝑥 ∣ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)} | |
15 | 14 | eqabri 2883 | . . . . 5 ⊢ (𝑥 ∈ 𝐶 ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)) |
16 | vex 3482 | . . . . . 6 ⊢ 𝑧 ∈ V | |
17 | oveq2 7439 | . . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑦 +Q 𝑥) = (𝑦 +Q 𝑧)) | |
18 | 17 | eleq1d 2824 | . . . . . . . 8 ⊢ (𝑥 = 𝑧 → ((𝑦 +Q 𝑥) ∈ 𝐵 ↔ (𝑦 +Q 𝑧) ∈ 𝐵)) |
19 | 18 | anbi2d 630 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → ((¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) ↔ (¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
20 | 19 | exbidv 1919 | . . . . . 6 ⊢ (𝑥 = 𝑧 → (∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
21 | 16, 20, 14 | elab2 3685 | . . . . 5 ⊢ (𝑧 ∈ 𝐶 ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵)) |
22 | 13, 15, 21 | 3imtr4g 296 | . . . 4 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → (𝑥 ∈ 𝐶 → 𝑧 ∈ 𝐶)) |
23 | 22 | ex 412 | . . 3 ⊢ (𝐵 ∈ P → (𝑧 <Q 𝑥 → (𝑥 ∈ 𝐶 → 𝑧 ∈ 𝐶))) |
24 | 23 | com23 86 | . 2 ⊢ (𝐵 ∈ P → (𝑥 ∈ 𝐶 → (𝑧 <Q 𝑥 → 𝑧 ∈ 𝐶))) |
25 | 24 | alrimdv 1927 | 1 ⊢ (𝐵 ∈ P → (𝑥 ∈ 𝐶 → ∀𝑧(𝑧 <Q 𝑥 → 𝑧 ∈ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1535 = wceq 1537 ∃wex 1776 ∈ wcel 2106 {cab 2712 class class class wbr 5148 × cxp 5687 (class class class)co 7431 Qcnq 10890 +Q cplq 10893 <Q cltq 10896 Pcnp 10897 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-oadd 8509 df-omul 8510 df-er 8744 df-ni 10910 df-pli 10911 df-mi 10912 df-lti 10913 df-plpq 10946 df-ltpq 10948 df-enq 10949 df-nq 10950 df-erq 10951 df-plq 10952 df-1nq 10954 df-ltnq 10956 df-np 11019 |
This theorem is referenced by: ltexprlem5 11078 |
Copyright terms: Public domain | W3C validator |