MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eupth2lem2 Structured version   Visualization version   GIF version

Theorem eupth2lem2 27392
Description: Lemma for eupth2 27412. (Contributed by Mario Carneiro, 8-Apr-2015.)
Hypothesis
Ref Expression
eupth2lem2.1 𝐵 ∈ V
Assertion
Ref Expression
eupth2lem2 ((𝐵𝐶𝐵 = 𝑈) → (¬ 𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) ↔ 𝑈 ∈ if(𝐴 = 𝐶, ∅, {𝐴, 𝐶})))

Proof of Theorem eupth2lem2
StepHypRef Expression
1 eqidd 2761 . . . . . . 7 ((𝐵𝐶𝐵 = 𝑈) → 𝐵 = 𝐵)
21olcd 407 . . . . . 6 ((𝐵𝐶𝐵 = 𝑈) → (𝐵 = 𝐴𝐵 = 𝐵))
32biantrud 529 . . . . 5 ((𝐵𝐶𝐵 = 𝑈) → (𝐴𝐵 ↔ (𝐴𝐵 ∧ (𝐵 = 𝐴𝐵 = 𝐵))))
4 eupth2lem2.1 . . . . . 6 𝐵 ∈ V
5 eupth2lem1 27391 . . . . . 6 (𝐵 ∈ V → (𝐵 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) ↔ (𝐴𝐵 ∧ (𝐵 = 𝐴𝐵 = 𝐵))))
64, 5ax-mp 5 . . . . 5 (𝐵 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) ↔ (𝐴𝐵 ∧ (𝐵 = 𝐴𝐵 = 𝐵)))
73, 6syl6bbr 278 . . . 4 ((𝐵𝐶𝐵 = 𝑈) → (𝐴𝐵𝐵 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵})))
8 simpr 479 . . . . 5 ((𝐵𝐶𝐵 = 𝑈) → 𝐵 = 𝑈)
98eleq1d 2824 . . . 4 ((𝐵𝐶𝐵 = 𝑈) → (𝐵 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) ↔ 𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵})))
107, 9bitrd 268 . . 3 ((𝐵𝐶𝐵 = 𝑈) → (𝐴𝐵𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵})))
1110necon1bbid 2971 . 2 ((𝐵𝐶𝐵 = 𝑈) → (¬ 𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) ↔ 𝐴 = 𝐵))
12 simpl 474 . . . . . . 7 ((𝐵𝐶𝐵 = 𝑈) → 𝐵𝐶)
13 neeq1 2994 . . . . . . 7 (𝐵 = 𝐴 → (𝐵𝐶𝐴𝐶))
1412, 13syl5ibcom 235 . . . . . 6 ((𝐵𝐶𝐵 = 𝑈) → (𝐵 = 𝐴𝐴𝐶))
1514pm4.71rd 670 . . . . 5 ((𝐵𝐶𝐵 = 𝑈) → (𝐵 = 𝐴 ↔ (𝐴𝐶𝐵 = 𝐴)))
16 eqcom 2767 . . . . 5 (𝐴 = 𝐵𝐵 = 𝐴)
17 ancom 465 . . . . 5 ((𝐵 = 𝐴𝐴𝐶) ↔ (𝐴𝐶𝐵 = 𝐴))
1815, 16, 173bitr4g 303 . . . 4 ((𝐵𝐶𝐵 = 𝑈) → (𝐴 = 𝐵 ↔ (𝐵 = 𝐴𝐴𝐶)))
1912neneqd 2937 . . . . . . 7 ((𝐵𝐶𝐵 = 𝑈) → ¬ 𝐵 = 𝐶)
20 biorf 419 . . . . . . 7 𝐵 = 𝐶 → (𝐵 = 𝐴 ↔ (𝐵 = 𝐶𝐵 = 𝐴)))
2119, 20syl 17 . . . . . 6 ((𝐵𝐶𝐵 = 𝑈) → (𝐵 = 𝐴 ↔ (𝐵 = 𝐶𝐵 = 𝐴)))
22 orcom 401 . . . . . 6 ((𝐵 = 𝐶𝐵 = 𝐴) ↔ (𝐵 = 𝐴𝐵 = 𝐶))
2321, 22syl6bb 276 . . . . 5 ((𝐵𝐶𝐵 = 𝑈) → (𝐵 = 𝐴 ↔ (𝐵 = 𝐴𝐵 = 𝐶)))
2423anbi1d 743 . . . 4 ((𝐵𝐶𝐵 = 𝑈) → ((𝐵 = 𝐴𝐴𝐶) ↔ ((𝐵 = 𝐴𝐵 = 𝐶) ∧ 𝐴𝐶)))
2518, 24bitrd 268 . . 3 ((𝐵𝐶𝐵 = 𝑈) → (𝐴 = 𝐵 ↔ ((𝐵 = 𝐴𝐵 = 𝐶) ∧ 𝐴𝐶)))
26 ancom 465 . . 3 ((𝐴𝐶 ∧ (𝐵 = 𝐴𝐵 = 𝐶)) ↔ ((𝐵 = 𝐴𝐵 = 𝐶) ∧ 𝐴𝐶))
2725, 26syl6bbr 278 . 2 ((𝐵𝐶𝐵 = 𝑈) → (𝐴 = 𝐵 ↔ (𝐴𝐶 ∧ (𝐵 = 𝐴𝐵 = 𝐶))))
28 eupth2lem1 27391 . . . 4 (𝐵 ∈ V → (𝐵 ∈ if(𝐴 = 𝐶, ∅, {𝐴, 𝐶}) ↔ (𝐴𝐶 ∧ (𝐵 = 𝐴𝐵 = 𝐶))))
294, 28ax-mp 5 . . 3 (𝐵 ∈ if(𝐴 = 𝐶, ∅, {𝐴, 𝐶}) ↔ (𝐴𝐶 ∧ (𝐵 = 𝐴𝐵 = 𝐶)))
308eleq1d 2824 . . 3 ((𝐵𝐶𝐵 = 𝑈) → (𝐵 ∈ if(𝐴 = 𝐶, ∅, {𝐴, 𝐶}) ↔ 𝑈 ∈ if(𝐴 = 𝐶, ∅, {𝐴, 𝐶})))
3129, 30syl5bbr 274 . 2 ((𝐵𝐶𝐵 = 𝑈) → ((𝐴𝐶 ∧ (𝐵 = 𝐴𝐵 = 𝐶)) ↔ 𝑈 ∈ if(𝐴 = 𝐶, ∅, {𝐴, 𝐶})))
3211, 27, 313bitrd 294 1 ((𝐵𝐶𝐵 = 𝑈) → (¬ 𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) ↔ 𝑈 ∈ if(𝐴 = 𝐶, ∅, {𝐴, 𝐶})))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wo 382  wa 383   = wceq 1632  wcel 2139  wne 2932  Vcvv 3340  c0 4058  ifcif 4230  {cpr 4323
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-v 3342  df-dif 3718  df-un 3720  df-nul 4059  df-if 4231  df-sn 4322  df-pr 4324
This theorem is referenced by:  eupth2lem3lem4  27404
  Copyright terms: Public domain W3C validator