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

Theorem supeq123d 8563
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 4820 . . . . . . 7 (𝜑 → (𝑥𝐶𝑦𝑥𝐹𝑦))
54notbid 309 . . . . . 6 (𝜑 → (¬ 𝑥𝐶𝑦 ↔ ¬ 𝑥𝐹𝑦))
62, 5raleqbidv 3300 . . . . 5 (𝜑 → (∀𝑦𝐴 ¬ 𝑥𝐶𝑦 ↔ ∀𝑦𝐷 ¬ 𝑥𝐹𝑦))
73breqd 4820 . . . . . . 7 (𝜑 → (𝑦𝐶𝑥𝑦𝐹𝑥))
83breqd 4820 . . . . . . . 8 (𝜑 → (𝑦𝐶𝑧𝑦𝐹𝑧))
92, 8rexeqbidv 3301 . . . . . . 7 (𝜑 → (∃𝑧𝐴 𝑦𝐶𝑧 ↔ ∃𝑧𝐷 𝑦𝐹𝑧))
107, 9imbi12d 335 . . . . . 6 (𝜑 → ((𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧) ↔ (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧)))
111, 10raleqbidv 3300 . . . . 5 (𝜑 → (∀𝑦𝐵 (𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧) ↔ ∀𝑦𝐸 (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧)))
126, 11anbi12d 624 . . . 4 (𝜑 → ((∀𝑦𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦𝐵 (𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧)) ↔ (∀𝑦𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦𝐸 (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧))))
131, 12rabeqbidv 3344 . . 3 (𝜑 → {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦𝐵 (𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧))} = {𝑥𝐸 ∣ (∀𝑦𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦𝐸 (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧))})
1413unieqd 4604 . 2 (𝜑 {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦𝐵 (𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧))} = {𝑥𝐸 ∣ (∀𝑦𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦𝐸 (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧))})
15 df-sup 8555 . 2 sup(𝐴, 𝐵, 𝐶) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦𝐵 (𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧))}
16 df-sup 8555 . 2 sup(𝐷, 𝐸, 𝐹) = {𝑥𝐸 ∣ (∀𝑦𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦𝐸 (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧))}
1714, 15, 163eqtr4g 2824 1 (𝜑 → sup(𝐴, 𝐵, 𝐶) = sup(𝐷, 𝐸, 𝐹))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 384   = wceq 1652  wral 3055  wrex 3056  {crab 3059   cuni 4594   class class class wbr 4809  supcsup 8553
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2069  ax-7 2105  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-ext 2743
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2062  df-clab 2752  df-cleq 2758  df-clel 2761  df-nfc 2896  df-ral 3060  df-rex 3061  df-rab 3064  df-uni 4595  df-br 4810  df-sup 8555
This theorem is referenced by:  infeq123d  8594  wlimeq12  32140  aomclem8  38240
  Copyright terms: Public domain W3C validator