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

Theorem supeq123d 8239
 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 4594 . . . . . . 7 (𝜑 → (𝑥𝐶𝑦𝑥𝐹𝑦))
54notbid 307 . . . . . 6 (𝜑 → (¬ 𝑥𝐶𝑦 ↔ ¬ 𝑥𝐹𝑦))
62, 5raleqbidv 3129 . . . . 5 (𝜑 → (∀𝑦𝐴 ¬ 𝑥𝐶𝑦 ↔ ∀𝑦𝐷 ¬ 𝑥𝐹𝑦))
73breqd 4594 . . . . . . 7 (𝜑 → (𝑦𝐶𝑥𝑦𝐹𝑥))
83breqd 4594 . . . . . . . 8 (𝜑 → (𝑦𝐶𝑧𝑦𝐹𝑧))
92, 8rexeqbidv 3130 . . . . . . 7 (𝜑 → (∃𝑧𝐴 𝑦𝐶𝑧 ↔ ∃𝑧𝐷 𝑦𝐹𝑧))
107, 9imbi12d 333 . . . . . 6 (𝜑 → ((𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧) ↔ (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧)))
111, 10raleqbidv 3129 . . . . 5 (𝜑 → (∀𝑦𝐵 (𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧) ↔ ∀𝑦𝐸 (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧)))
126, 11anbi12d 743 . . . 4 (𝜑 → ((∀𝑦𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦𝐵 (𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧)) ↔ (∀𝑦𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦𝐸 (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧))))
131, 12rabeqbidv 3168 . . 3 (𝜑 → {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦𝐵 (𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧))} = {𝑥𝐸 ∣ (∀𝑦𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦𝐸 (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧))})
1413unieqd 4382 . 2 (𝜑 {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦𝐵 (𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧))} = {𝑥𝐸 ∣ (∀𝑦𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦𝐸 (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧))})
15 df-sup 8231 . 2 sup(𝐴, 𝐵, 𝐶) = {𝑥𝐵 ∣ (∀𝑦𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦𝐵 (𝑦𝐶𝑥 → ∃𝑧𝐴 𝑦𝐶𝑧))}
16 df-sup 8231 . 2 sup(𝐷, 𝐸, 𝐹) = {𝑥𝐸 ∣ (∀𝑦𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦𝐸 (𝑦𝐹𝑥 → ∃𝑧𝐷 𝑦𝐹𝑧))}
1714, 15, 163eqtr4g 2669 1 (𝜑 → sup(𝐴, 𝐵, 𝐶) = sup(𝐷, 𝐸, 𝐹))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475  ∀wral 2896  ∃wrex 2897  {crab 2900  ∪ cuni 4372   class class class wbr 4583  supcsup 8229 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-uni 4373  df-br 4584  df-sup 8231 This theorem is referenced by:  infeq123d  8270  wlimeq12  31009  aomclem8  36649
 Copyright terms: Public domain W3C validator