![]() |
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 11022 | . . . . . . . . . 10 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑦 +Q 𝑥) ∈ Q) | |
2 | addnqf 10979 | . . . . . . . . . . . . 13 ⊢ +Q :(Q × Q)⟶Q | |
3 | 2 | fdmi 6739 | . . . . . . . . . . . 12 ⊢ dom +Q = (Q × Q) |
4 | 0nnq 10955 | . . . . . . . . . . . 12 ⊢ ¬ ∅ ∈ Q | |
5 | 3, 4 | ndmovrcl 7613 | . . . . . . . . . . 11 ⊢ ((𝑦 +Q 𝑥) ∈ Q → (𝑦 ∈ Q ∧ 𝑥 ∈ Q)) |
6 | 5 | simpld 493 | . . . . . . . . . 10 ⊢ ((𝑦 +Q 𝑥) ∈ Q → 𝑦 ∈ Q) |
7 | ltanq 11002 | . . . . . . . . . 10 ⊢ (𝑦 ∈ Q → (𝑧 <Q 𝑥 ↔ (𝑦 +Q 𝑧) <Q (𝑦 +Q 𝑥))) | |
8 | 1, 6, 7 | 3syl 18 | . . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑧 <Q 𝑥 ↔ (𝑦 +Q 𝑧) <Q (𝑦 +Q 𝑥))) |
9 | prcdnq 11024 | . . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → ((𝑦 +Q 𝑧) <Q (𝑦 +Q 𝑥) → (𝑦 +Q 𝑧) ∈ 𝐵)) | |
10 | 8, 9 | sylbid 239 | . . . . . . . 8 ⊢ ((𝐵 ∈ P ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (𝑧 <Q 𝑥 → (𝑦 +Q 𝑧) ∈ 𝐵)) |
11 | 10 | impancom 450 | . . . . . . 7 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → ((𝑦 +Q 𝑥) ∈ 𝐵 → (𝑦 +Q 𝑧) ∈ 𝐵)) |
12 | 11 | anim2d 610 | . . . . . 6 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → ((¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → (¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
13 | 12 | eximdv 1912 | . . . . 5 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → (∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) → ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
14 | ltexprlem.1 | . . . . . 6 ⊢ 𝐶 = {𝑥 ∣ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)} | |
15 | 14 | eqabri 2873 | . . . . 5 ⊢ (𝑥 ∈ 𝐶 ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)) |
16 | vex 3477 | . . . . . 6 ⊢ 𝑧 ∈ V | |
17 | oveq2 7434 | . . . . . . . . 9 ⊢ (𝑥 = 𝑧 → (𝑦 +Q 𝑥) = (𝑦 +Q 𝑧)) | |
18 | 17 | eleq1d 2814 | . . . . . . . 8 ⊢ (𝑥 = 𝑧 → ((𝑦 +Q 𝑥) ∈ 𝐵 ↔ (𝑦 +Q 𝑧) ∈ 𝐵)) |
19 | 18 | anbi2d 628 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → ((¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) ↔ (¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
20 | 19 | exbidv 1916 | . . . . . 6 ⊢ (𝑥 = 𝑧 → (∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵))) |
21 | 16, 20, 14 | elab2 3673 | . . . . 5 ⊢ (𝑧 ∈ 𝐶 ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑧) ∈ 𝐵)) |
22 | 13, 15, 21 | 3imtr4g 295 | . . . 4 ⊢ ((𝐵 ∈ P ∧ 𝑧 <Q 𝑥) → (𝑥 ∈ 𝐶 → 𝑧 ∈ 𝐶)) |
23 | 22 | ex 411 | . . 3 ⊢ (𝐵 ∈ P → (𝑧 <Q 𝑥 → (𝑥 ∈ 𝐶 → 𝑧 ∈ 𝐶))) |
24 | 23 | com23 86 | . 2 ⊢ (𝐵 ∈ P → (𝑥 ∈ 𝐶 → (𝑧 <Q 𝑥 → 𝑧 ∈ 𝐶))) |
25 | 24 | alrimdv 1924 | 1 ⊢ (𝐵 ∈ P → (𝑥 ∈ 𝐶 → ∀𝑧(𝑧 <Q 𝑥 → 𝑧 ∈ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∀wal 1531 = wceq 1533 ∃wex 1773 ∈ wcel 2098 {cab 2705 class class class wbr 5152 × cxp 5680 (class class class)co 7426 Qcnq 10883 +Q cplq 10886 <Q cltq 10889 Pcnp 10890 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pr 5433 ax-un 7746 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-1st 7999 df-2nd 8000 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-1o 8493 df-oadd 8497 df-omul 8498 df-er 8731 df-ni 10903 df-pli 10904 df-mi 10905 df-lti 10906 df-plpq 10939 df-ltpq 10941 df-enq 10942 df-nq 10943 df-erq 10944 df-plq 10945 df-1nq 10947 df-ltnq 10949 df-np 11012 |
This theorem is referenced by: ltexprlem5 11071 |
Copyright terms: Public domain | W3C validator |