Users' Mathboxes Mathbox for Rodolfo Medina < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  prtlem10 Structured version   Visualization version   GIF version

Theorem prtlem10 40015
Description: Lemma for prter3 40032. (Contributed by Rodolfo Medina, 14-Oct-2010.) (Revised by Mario Carneiro, 12-Aug-2015.)
Assertion
Ref Expression
prtlem10 ( ∼ Er 𝐴 → (𝑧 ∈ 𝐴 → (𝑧 ∼ 𝑤 ↔ ∃𝑣 ∈ 𝐴 (𝑧 ∈ [𝑣] ∼ ∧ 𝑤 ∈ [𝑣] ∼ ))))
Distinct variable groups:   𝑤,𝑣   𝑧,𝑣   𝑣,𝐴   𝑣, ∼
Allowed substitution hints:   𝐴(𝑧, 𝑤)   ∼ (𝑧, 𝑤)

Proof of Theorem prtlem10
StepHypRef Expression
1 simpr 490 . . . . 5 (( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) → 𝑧 ∈ 𝐴)
2 simpl 488 . . . . . 6 (( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) → ∼ Er 𝐴)
32, 1erref 8741 . . . . 5 (( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) → 𝑧 ∼ 𝑧)
4 breq1 5105 . . . . . . . 8 (𝑣 = 𝑧 → (𝑣 ∼ 𝑧 ↔ 𝑧 ∼ 𝑧))
5 breq1 5105 . . . . . . . 8 (𝑣 = 𝑧 → (𝑣 ∼ 𝑤 ↔ 𝑧 ∼ 𝑤))
64, 5anbi12d 644 . . . . . . 7 (𝑣 = 𝑧 → ((𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤) ↔ (𝑧 ∼ 𝑧 ∧ 𝑧 ∼ 𝑤)))
76rspcev 3576 . . . . . 6 ((𝑧 ∈ 𝐴 ∧ (𝑧 ∼ 𝑧 ∧ 𝑧 ∼ 𝑤)) → ∃𝑣 ∈ 𝐴 (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤))
87expr 462 . . . . 5 ((𝑧 ∈ 𝐴 ∧ 𝑧 ∼ 𝑧) → (𝑧 ∼ 𝑤 → ∃𝑣 ∈ 𝐴 (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤)))
91, 3, 8syl2anc 596 . . . 4 (( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑧 ∼ 𝑤 → ∃𝑣 ∈ 𝐴 (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤)))
10 simplll 787 . . . . . 6 (((( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 ∈ 𝐴) ∧ (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤)) → ∼ Er 𝐴)
11 simprl 783 . . . . . 6 (((( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 ∈ 𝐴) ∧ (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤)) → 𝑣 ∼ 𝑧)
12 simprr 785 . . . . . 6 (((( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 ∈ 𝐴) ∧ (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤)) → 𝑣 ∼ 𝑤)
1310, 11, 12ertr3d 8739 . . . . 5 (((( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ 𝑣 ∈ 𝐴) ∧ (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤)) → 𝑧 ∼ 𝑤)
1413rexlimdva2 3165 . . . 4 (( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) → (∃𝑣 ∈ 𝐴 (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤) → 𝑧 ∼ 𝑤))
159, 14impbid 215 . . 3 (( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑧 ∼ 𝑤 ↔ ∃𝑣 ∈ 𝐴 (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤)))
16 vex 3454 . . . . . 6 𝑧 ∈ V
17 vex 3454 . . . . . 6 𝑣 ∈ V
1816, 17elec 8767 . . . . 5 (𝑧 ∈ [𝑣] ∼ ↔ 𝑣 ∼ 𝑧)
19 vex 3454 . . . . . 6 𝑤 ∈ V
2019, 17elec 8767 . . . . 5 (𝑤 ∈ [𝑣] ∼ ↔ 𝑣 ∼ 𝑤)
2118, 20anbi12i 640 . . . 4 ((𝑧 ∈ [𝑣] ∼ ∧ 𝑤 ∈ [𝑣] ∼ ) ↔ (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤))
2221rexbii 3109 . . 3 (∃𝑣 ∈ 𝐴 (𝑧 ∈ [𝑣] ∼ ∧ 𝑤 ∈ [𝑣] ∼ ) ↔ ∃𝑣 ∈ 𝐴 (𝑣 ∼ 𝑧 ∧ 𝑣 ∼ 𝑤))
2315, 22bitr4di 292 . 2 (( ∼ Er 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑧 ∼ 𝑤 ↔ ∃𝑣 ∈ 𝐴 (𝑧 ∈ [𝑣] ∼ ∧ 𝑤 ∈ [𝑣] ∼ )))
2423ex 418 1 ( ∼ Er 𝐴 → (𝑧 ∈ 𝐴 → (𝑧 ∼ 𝑤 ↔ ∃𝑣 ∈ 𝐴 (𝑧 ∈ [𝑣] ∼ ∧ 𝑤 ∈ [𝑣] ∼ ))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2144  ∃wrex 3086   class class class wbr 5102   Er wer 8717  [cec 8718
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-er 8720  df-ec 8722
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator