Users' Mathboxes Mathbox for Brendan Leahy < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fin2solem Structured version   Visualization version   GIF version

Theorem fin2solem 35316
Description: Lemma for fin2so 35317. (Contributed by Brendan Leahy, 29-Jun-2019.)
Assertion
Ref Expression
fin2solem ((𝑅 Or 𝑥 ∧ (𝑦𝑥𝑧𝑥)) → (𝑦𝑅𝑧 → {𝑤𝑥𝑤𝑅𝑦} [] {𝑤𝑥𝑤𝑅𝑧}))
Distinct variable group:   𝑥,𝑤,𝑦,𝑧,𝑅

Proof of Theorem fin2solem
StepHypRef Expression
1 ancom 465 . . . . . . . . . 10 (((𝑦𝑥𝑧𝑥) ∧ 𝑤𝑥) ↔ (𝑤𝑥 ∧ (𝑦𝑥𝑧𝑥)))
2 3anass 1093 . . . . . . . . . 10 ((𝑤𝑥𝑦𝑥𝑧𝑥) ↔ (𝑤𝑥 ∧ (𝑦𝑥𝑧𝑥)))
31, 2bitr4i 281 . . . . . . . . 9 (((𝑦𝑥𝑧𝑥) ∧ 𝑤𝑥) ↔ (𝑤𝑥𝑦𝑥𝑧𝑥))
4 sotr 5467 . . . . . . . . 9 ((𝑅 Or 𝑥 ∧ (𝑤𝑥𝑦𝑥𝑧𝑥)) → ((𝑤𝑅𝑦𝑦𝑅𝑧) → 𝑤𝑅𝑧))
53, 4sylan2b 597 . . . . . . . 8 ((𝑅 Or 𝑥 ∧ ((𝑦𝑥𝑧𝑥) ∧ 𝑤𝑥)) → ((𝑤𝑅𝑦𝑦𝑅𝑧) → 𝑤𝑅𝑧))
65anassrs 472 . . . . . . 7 (((𝑅 Or 𝑥 ∧ (𝑦𝑥𝑧𝑥)) ∧ 𝑤𝑥) → ((𝑤𝑅𝑦𝑦𝑅𝑧) → 𝑤𝑅𝑧))
76ancomsd 470 . . . . . 6 (((𝑅 Or 𝑥 ∧ (𝑦𝑥𝑧𝑥)) ∧ 𝑤𝑥) → ((𝑦𝑅𝑧𝑤𝑅𝑦) → 𝑤𝑅𝑧))
87expdimp 457 . . . . 5 ((((𝑅 Or 𝑥 ∧ (𝑦𝑥𝑧𝑥)) ∧ 𝑤𝑥) ∧ 𝑦𝑅𝑧) → (𝑤𝑅𝑦𝑤𝑅𝑧))
98an32s 652 . . . 4 ((((𝑅 Or 𝑥 ∧ (𝑦𝑥𝑧𝑥)) ∧ 𝑦𝑅𝑧) ∧ 𝑤𝑥) → (𝑤𝑅𝑦𝑤𝑅𝑧))
109ss2rabdv 3981 . . 3 (((𝑅 Or 𝑥 ∧ (𝑦𝑥𝑧𝑥)) ∧ 𝑦𝑅𝑧) → {𝑤𝑥𝑤𝑅𝑦} ⊆ {𝑤𝑥𝑤𝑅𝑧})
11 breq1 5036 . . . . . . . 8 (𝑤 = 𝑦 → (𝑤𝑅𝑧𝑦𝑅𝑧))
1211elrab 3603 . . . . . . 7 (𝑦 ∈ {𝑤𝑥𝑤𝑅𝑧} ↔ (𝑦𝑥𝑦𝑅𝑧))
1312biimpri 231 . . . . . 6 ((𝑦𝑥𝑦𝑅𝑧) → 𝑦 ∈ {𝑤𝑥𝑤𝑅𝑧})
1413adantll 714 . . . . 5 (((𝑅 Or 𝑥𝑦𝑥) ∧ 𝑦𝑅𝑧) → 𝑦 ∈ {𝑤𝑥𝑤𝑅𝑧})
15 sonr 5466 . . . . . . 7 ((𝑅 Or 𝑥𝑦𝑥) → ¬ 𝑦𝑅𝑦)
16 breq1 5036 . . . . . . . . 9 (𝑤 = 𝑦 → (𝑤𝑅𝑦𝑦𝑅𝑦))
1716elrab 3603 . . . . . . . 8 (𝑦 ∈ {𝑤𝑥𝑤𝑅𝑦} ↔ (𝑦𝑥𝑦𝑅𝑦))
1817simprbi 501 . . . . . . 7 (𝑦 ∈ {𝑤𝑥𝑤𝑅𝑦} → 𝑦𝑅𝑦)
1915, 18nsyl 142 . . . . . 6 ((𝑅 Or 𝑥𝑦𝑥) → ¬ 𝑦 ∈ {𝑤𝑥𝑤𝑅𝑦})
2019adantr 485 . . . . 5 (((𝑅 Or 𝑥𝑦𝑥) ∧ 𝑦𝑅𝑧) → ¬ 𝑦 ∈ {𝑤𝑥𝑤𝑅𝑦})
21 nelne1 3048 . . . . . 6 ((𝑦 ∈ {𝑤𝑥𝑤𝑅𝑧} ∧ ¬ 𝑦 ∈ {𝑤𝑥𝑤𝑅𝑦}) → {𝑤𝑥𝑤𝑅𝑧} ≠ {𝑤𝑥𝑤𝑅𝑦})
2221necomd 3007 . . . . 5 ((𝑦 ∈ {𝑤𝑥𝑤𝑅𝑧} ∧ ¬ 𝑦 ∈ {𝑤𝑥𝑤𝑅𝑦}) → {𝑤𝑥𝑤𝑅𝑦} ≠ {𝑤𝑥𝑤𝑅𝑧})
2314, 20, 22syl2anc 588 . . . 4 (((𝑅 Or 𝑥𝑦𝑥) ∧ 𝑦𝑅𝑧) → {𝑤𝑥𝑤𝑅𝑦} ≠ {𝑤𝑥𝑤𝑅𝑧})
2423adantlrr 721 . . 3 (((𝑅 Or 𝑥 ∧ (𝑦𝑥𝑧𝑥)) ∧ 𝑦𝑅𝑧) → {𝑤𝑥𝑤𝑅𝑦} ≠ {𝑤𝑥𝑤𝑅𝑧})
25 vex 3414 . . . . . 6 𝑥 ∈ V
2625rabex 5203 . . . . 5 {𝑤𝑥𝑤𝑅𝑧} ∈ V
2726brrpss 7451 . . . 4 ({𝑤𝑥𝑤𝑅𝑦} [] {𝑤𝑥𝑤𝑅𝑧} ↔ {𝑤𝑥𝑤𝑅𝑦} ⊊ {𝑤𝑥𝑤𝑅𝑧})
28 df-pss 3878 . . . 4 ({𝑤𝑥𝑤𝑅𝑦} ⊊ {𝑤𝑥𝑤𝑅𝑧} ↔ ({𝑤𝑥𝑤𝑅𝑦} ⊆ {𝑤𝑥𝑤𝑅𝑧} ∧ {𝑤𝑥𝑤𝑅𝑦} ≠ {𝑤𝑥𝑤𝑅𝑧}))
2927, 28bitri 278 . . 3 ({𝑤𝑥𝑤𝑅𝑦} [] {𝑤𝑥𝑤𝑅𝑧} ↔ ({𝑤𝑥𝑤𝑅𝑦} ⊆ {𝑤𝑥𝑤𝑅𝑧} ∧ {𝑤𝑥𝑤𝑅𝑦} ≠ {𝑤𝑥𝑤𝑅𝑧}))
3010, 24, 29sylanbrc 587 . 2 (((𝑅 Or 𝑥 ∧ (𝑦𝑥𝑧𝑥)) ∧ 𝑦𝑅𝑧) → {𝑤𝑥𝑤𝑅𝑦} [] {𝑤𝑥𝑤𝑅𝑧})
3130ex 417 1 ((𝑅 Or 𝑥 ∧ (𝑦𝑥𝑧𝑥)) → (𝑦𝑅𝑧 → {𝑤𝑥𝑤𝑅𝑦} [] {𝑤𝑥𝑤𝑅𝑧}))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  w3a 1085  wcel 2112  wne 2952  {crab 3075  wss 3859  wpss 3860   class class class wbr 5033   Or wor 5443   [] crpss 7447
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 1912  ax-6 1971  ax-7 2016  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2730  ax-sep 5170  ax-nul 5177  ax-pr 5299
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 846  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2071  df-clab 2737  df-cleq 2751  df-clel 2831  df-nfc 2902  df-ne 2953  df-ral 3076  df-rex 3077  df-rab 3080  df-v 3412  df-dif 3862  df-un 3864  df-in 3866  df-ss 3876  df-pss 3878  df-nul 4227  df-if 4422  df-sn 4524  df-pr 4526  df-op 4530  df-br 5034  df-opab 5096  df-po 5444  df-so 5445  df-xp 5531  df-rel 5532  df-rpss 7448
This theorem is referenced by:  fin2so  35317
  Copyright terms: Public domain W3C validator