| 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 4425 | . . 3 ⊢ (𝐴 ⊊ 𝐵 → ∃𝑦(𝑦 ∈ 𝐵 ∧ ¬ 𝑦 ∈ 𝐴)) | |
| 2 | prnmadd 10920 | . . . . . . . . 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 4307 | . . 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 3904 ∅c0 4287 (class class class)co 7368 +Q cplq 10778 Pcnp 10782 |
| 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 5243 ax-nul 5253 ax-pr 5379 ax-un 7690 |
| 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 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-oadd 8411 df-omul 8412 df-er 8645 df-ni 10795 df-pli 10796 df-mi 10797 df-lti 10798 df-plpq 10831 df-mpq 10832 df-ltpq 10833 df-enq 10834 df-nq 10835 df-erq 10836 df-plq 10837 df-mq 10838 df-1nq 10839 df-ltnq 10841 df-np 10904 |
| This theorem is referenced by: ltexprlem5 10963 |
| Copyright terms: Public domain | W3C validator |