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

Theorem supeq123d 9479
Description: Equality deduction for supremum. (Contributed by Stefan O'Rear, 20-Jan-2015.)
Hypotheses
Ref Expression
supeq123d.a (𝜑 → 𝐴 = 𝐷)
supeq123d.b (𝜑 → 𝐵 = 𝐸)
supeq123d.c (𝜑 → 𝐶 = 𝐹)
Assertion
Ref Expression
supeq123d (𝜑 → sup(𝐴, 𝐵, 𝐶) = sup(𝐷, 𝐸, 𝐹))

Proof of Theorem supeq123d
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 supeq123d.b . . . 4 (𝜑 → 𝐵 = 𝐸)
2 supeq123d.a . . . . . 6 (𝜑 → 𝐴 = 𝐷)
3 supeq123d.c . . . . . . . 8 (𝜑 → 𝐶 = 𝐹)
43breqd 5119 . . . . . . 7 (𝜑 → (𝑥𝐶𝑦 ↔ 𝑥𝐹𝑦))
54notbid 321 . . . . . 6 (𝜑 → (¬ 𝑥𝐶𝑦 ↔ ¬ 𝑥𝐹𝑦))
62, 5raleqbidv 3338 . . . . 5 (𝜑 → (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ↔ ∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦))
73breqd 5119 . . . . . . 7 (𝜑 → (𝑦𝐶𝑥 ↔ 𝑦𝐹𝑥))
83breqd 5119 . . . . . . . 8 (𝜑 → (𝑦𝐶𝑧 ↔ 𝑦𝐹𝑧))
92, 8rexeqbidv 3339 . . . . . . 7 (𝜑 → (∃𝑧 ∈ 𝐴 𝑦𝐶𝑧 ↔ ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))
107, 9imbi12d 347 . . . . . 6 (𝜑 → ((𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧) ↔ (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧)))
111, 10raleqbidv 3338 . . . . 5 (𝜑 → (∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧) ↔ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧)))
126, 11anbi12d 644 . . . 4 (𝜑 → ((∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧)) ↔ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))))
131, 12rabeqbidv 3433 . . 3 (𝜑 → {𝑥 ∈ 𝐵 ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧))} = {𝑥 ∈ 𝐸 ∣ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))})
1413unieqd 4885 . 2 (𝜑 → ∪ {𝑥 ∈ 𝐵 ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧))} = ∪ {𝑥 ∈ 𝐸 ∣ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))})
15 df-sup 9471 . 2 sup(𝐴, 𝐵, 𝐶) = ∪ {𝑥 ∈ 𝐵 ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧))}
16 df-sup 9471 . 2 sup(𝐷, 𝐸, 𝐹) = ∪ {𝑥 ∈ 𝐸 ∣ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))}
1714, 15, 163eqtr4g 2823 1 (𝜑 → sup(𝐴, 𝐵, 𝐶) = sup(𝐷, 𝐸, 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570  ∀wral 3080  ∃wrex 3090  {crab 3416  ∪ cuni 4872   class class class wbr 5108  supcsup 9469
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-uni 4873  df-br 5109  df-sup 9471
This theorem is used by:  infeq123d  9511  wlimeq12  36796  aomclem8  44329
  Copyright terms: Public domain W3C validator