Theorem supeq123d 6871

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.

Step	Hyp	Ref	Expression
1		supeq123d.b	. . . 4 ⊢ (𝜑 → 𝐵 = 𝐸)
2		supeq123d.a	. . . . . 6 ⊢ (𝜑 → 𝐴 = 𝐷)
3		supeq123d.c	. . . . . . . 8 ⊢ (𝜑 → 𝐶 = 𝐹)
4	3	breqd 3935	. . . . . . 7 ⊢ (𝜑 → (𝑥𝐶𝑦 ↔ 𝑥𝐹𝑦))
5	4	notbid 656	. . . . . 6 ⊢ (𝜑 → (¬ 𝑥𝐶𝑦 ↔ ¬ 𝑥𝐹𝑦))
6	2, 5	raleqbidv 2636	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ↔ ∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦))
7	3	breqd 3935	. . . . . . 7 ⊢ (𝜑 → (𝑦𝐶𝑥 ↔ 𝑦𝐹𝑥))
8	3	breqd 3935	. . . . . . . 8 ⊢ (𝜑 → (𝑦𝐶𝑧 ↔ 𝑦𝐹𝑧))
9	2, 8	rexeqbidv 2637	. . . . . . 7 ⊢ (𝜑 → (∃𝑧 ∈ 𝐴 𝑦𝐶𝑧 ↔ ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))
10	7, 9	imbi12d 233	. . . . . 6 ⊢ (𝜑 → ((𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧) ↔ (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧)))
11	1, 10	raleqbidv 2636	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧) ↔ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧)))
12	6, 11	anbi12d 464	. . . 4 ⊢ (𝜑 → ((∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧)) ↔ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))))
13	1, 12	rabeqbidv 2676	. . 3 ⊢ (𝜑 → {𝑥 ∈ 𝐵 ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧))} = {𝑥 ∈ 𝐸 ∣ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))})
14	13	unieqd 3742	. 2 ⊢ (𝜑 → ∪ {𝑥 ∈ 𝐵 ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧))} = ∪ {𝑥 ∈ 𝐸 ∣ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))})
15		df-sup 6864	. 2 ⊢ sup(𝐴, 𝐵, 𝐶) = ∪ {𝑥 ∈ 𝐵 ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧))}
16		df-sup 6864	. 2 ⊢ sup(𝐷, 𝐸, 𝐹) = ∪ {𝑥 ∈ 𝐸 ∣ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))}
17	14, 15, 16	3eqtr4g 2195	1 ⊢ (𝜑 → sup(𝐴, 𝐵, 𝐶) = sup(𝐷, 𝐸, 𝐹))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   = wceq 1331  ∀wral 2414  ∃wrex 2415  {crab 2418  ∪ cuni 3731   class class class wbr 3924  supcsup 6862

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-rab 2423  df-uni 3732  df-br 3925  df-sup 6864

This theorem is referenced by:  infeq123d  6896