| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ltexprlem1 | 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 |
|---|---|
| ltexprlem1 | ⊢ (𝐵 ∈ P → (𝐴 ⊊ 𝐵 → 𝐶 ≠ ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pssnel 4412 | . . 3 ⊢ (𝐴 ⊊ 𝐵 → ∃𝑦(𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐴)) | |
| 2 | prnmadd 10914 | . . . . . . . . 9 ⊢ ((𝐵 ∈ P ∧ 𝑦 ∈ 𝐵) → ∃𝑥(𝑦 +Q 𝑥) ∈ 𝐵) | |
| 3 | 2 | anim2i 618 | . . . . . . . 8 ⊢ ((¬ 𝑦 ∈ 𝐴 ∧ (𝐵 ∈ P ∧ 𝑦 ∈ 𝐵)) → (¬ 𝑦 ∈ 𝐴 ∧ ∃𝑥(𝑦 +Q 𝑥) ∈ 𝐵)) |
| 4 | 19.42v 1955 | . . . . . . . 8 ⊢ (∃𝑥(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) ↔ (¬ 𝑦 ∈ 𝐴 ∧ ∃𝑥(𝑦 +Q 𝑥) ∈ 𝐵)) | |
| 5 | 3, 4 | sylibr 234 | . . . . . . 7 ⊢ ((¬ 𝑦 ∈ 𝐴 ∧ (𝐵 ∈ P ∧ 𝑦 ∈ 𝐵)) → ∃𝑥(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)) |
| 6 | 5 | exp32 420 | . . . . . 6 ⊢ (¬ 𝑦 ∈ 𝐴 → (𝐵 ∈ P → (𝑦 ∈ 𝐵 → ∃𝑥(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)))) |
| 7 | 6 | com3l 89 | . . . . 5 ⊢ (𝐵 ∈ P → (𝑦 ∈ 𝐵 → (¬ 𝑦 ∈ 𝐴 → ∃𝑥(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)))) |
| 8 | 7 | impd 410 | . . . 4 ⊢ (𝐵 ∈ P → ((𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐴) → ∃𝑥(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵))) |
| 9 | 8 | eximdv 1919 | . . 3 ⊢ (𝐵 ∈ P → (∃𝑦(𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐴) → ∃𝑦∃𝑥(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵))) |
| 10 | 1, 9 | syl5 34 | . 2 ⊢ (𝐵 ∈ P → (𝐴 ⊊ 𝐵 → ∃𝑦∃𝑥(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵))) |
| 11 | ltexprlem.1 | . . . . 5 ⊢ 𝐶 = {𝑥 ∣ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)} | |
| 12 | 11 | eqabri 2879 | . . . 4 ⊢ (𝑥 ∈ 𝐶 ↔ ∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)) |
| 13 | 12 | exbii 1850 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐶 ↔ ∃𝑥∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)) |
| 14 | n0 4294 | . . 3 ⊢ (𝐶 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐶) | |
| 15 | excom 2168 | . . 3 ⊢ (∃𝑦∃𝑥(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵) ↔ ∃𝑥∃𝑦(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)) | |
| 16 | 13, 14, 15 | 3bitr4i 303 | . 2 ⊢ (𝐶 ≠ ∅ ↔ ∃𝑦∃𝑥(¬ 𝑦 ∈ 𝐴 ∧ (𝑦 +Q 𝑥) ∈ 𝐵)) |
| 17 | 10, 16 | imbitrrdi 252 | 1 ⊢ (𝐵 ∈ P → (𝐴 ⊊ 𝐵 → 𝐶 ≠ ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ∃wex 1781 ∈ wcel 2114 {cab 2715 ≠ wne 2933 ⊊ wpss 3891 ∅c0 4274 (class class class)co 7361 +Q cplq 10772 Pcnp 10776 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-oadd 8403 df-omul 8404 df-er 8637 df-ni 10789 df-pli 10790 df-mi 10791 df-lti 10792 df-plpq 10825 df-mpq 10826 df-ltpq 10827 df-enq 10828 df-nq 10829 df-erq 10830 df-plq 10831 df-mq 10832 df-1nq 10833 df-ltnq 10835 df-np 10898 |
| This theorem is referenced by: ltexprlem5 10957 |
| Copyright terms: Public domain | W3C validator |