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

Theorem eupth2lem1 30812
Description: Lemma for eupth2 30833. (Contributed by Mario Carneiro, 8-Apr-2015.)
Assertion
Ref Expression
eupth2lem1 (𝑈 ∈ 𝑉 → (𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) ↔ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵))))

Proof of Theorem eupth2lem1
StepHypRef Expression
1 eleq2 2850 . . 3 (∅ = if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) → (𝑈 ∈ ∅ ↔ 𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵})))
21bibi1d 346 . 2 (∅ = if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) → ((𝑈 ∈ ∅ ↔ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵))) ↔ (𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) ↔ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵)))))
3 eleq2 2850 . . 3 ({𝐴, 𝐵} = if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) → (𝑈 ∈ {𝐴, 𝐵} ↔ 𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵})))
43bibi1d 346 . 2 ({𝐴, 𝐵} = if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) → ((𝑈 ∈ {𝐴, 𝐵} ↔ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵))) ↔ (𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) ↔ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵)))))
5 noel 4284 . . . 4 ¬ 𝑈 ∈ ∅
65a1i 11 . . 3 ((𝑈 ∈ 𝑉 ∧ 𝐴 = 𝐵) → ¬ 𝑈 ∈ ∅)
7 simpl 488 . . . . 5 ((𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵)) → 𝐴 ≠ 𝐵)
87neneqd 2961 . . . 4 ((𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵)) → ¬ 𝐴 = 𝐵)
9 simpr 490 . . . 4 ((𝑈 ∈ 𝑉 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵)
108, 9nsyl3 139 . . 3 ((𝑈 ∈ 𝑉 ∧ 𝐴 = 𝐵) → ¬ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵)))
116, 102falsed 379 . 2 ((𝑈 ∈ 𝑉 ∧ 𝐴 = 𝐵) → (𝑈 ∈ ∅ ↔ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵))))
12 elprg 4607 . . 3 (𝑈 ∈ 𝑉 → (𝑈 ∈ {𝐴, 𝐵} ↔ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵)))
13 df-ne 2957 . . . 4 (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵)
14 ibar 538 . . . 4 (𝐴 ≠ 𝐵 → ((𝑈 = 𝐴 ∨ 𝑈 = 𝐵) ↔ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵))))
1513, 14sylbir 238 . . 3 (¬ 𝐴 = 𝐵 → ((𝑈 = 𝐴 ∨ 𝑈 = 𝐵) ↔ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵))))
1612, 15sylan9bb 519 . 2 ((𝑈 ∈ 𝑉 ∧ ¬ 𝐴 = 𝐵) → (𝑈 ∈ {𝐴, 𝐵} ↔ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵))))
172, 4, 11, 16ifbothda 4521 1 (𝑈 ∈ 𝑉 → (𝑈 ∈ if(𝐴 = 𝐵, ∅, {𝐴, 𝐵}) ↔ (𝐴 ≠ 𝐵 ∧ (𝑈 = 𝐴 ∨ 𝑈 = 𝐵))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ∅c0 4279  ifcif 4482  {cpr 4586
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-v 3453  df-dif 3902  df-un 3904  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587
This theorem is used by:  eupth2lem2  30813  eupth2lem3lem6  30827
  Copyright terms: Public domain W3C validator