Theorem supeq123d 6984

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 4011	. . . . . . 7 ⊢ (𝜑 → (𝑥𝐶𝑦 ↔ 𝑥𝐹𝑦))
5	4	notbid 667	. . . . . 6 ⊢ (𝜑 → (¬ 𝑥𝐶𝑦 ↔ ¬ 𝑥𝐹𝑦))
6	2, 5	raleqbidv 2684	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ↔ ∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦))
7	3	breqd 4011	. . . . . . 7 ⊢ (𝜑 → (𝑦𝐶𝑥 ↔ 𝑦𝐹𝑥))
8	3	breqd 4011	. . . . . . . 8 ⊢ (𝜑 → (𝑦𝐶𝑧 ↔ 𝑦𝐹𝑧))
9	2, 8	rexeqbidv 2685	. . . . . . 7 ⊢ (𝜑 → (∃𝑧 ∈ 𝐴 𝑦𝐶𝑧 ↔ ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))
10	7, 9	imbi12d 234	. . . . . 6 ⊢ (𝜑 → ((𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧) ↔ (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧)))
11	1, 10	raleqbidv 2684	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧) ↔ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧)))
12	6, 11	anbi12d 473	. . . 4 ⊢ (𝜑 → ((∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧)) ↔ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))))
13	1, 12	rabeqbidv 2732	. . 3 ⊢ (𝜑 → {𝑥 ∈ 𝐵 ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧))} = {𝑥 ∈ 𝐸 ∣ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))})
14	13	unieqd 3818	. 2 ⊢ (𝜑 → ∪ {𝑥 ∈ 𝐵 ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧))} = ∪ {𝑥 ∈ 𝐸 ∣ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))})
15		df-sup 6977	. 2 ⊢ sup(𝐴, 𝐵, 𝐶) = ∪ {𝑥 ∈ 𝐵 ∣ (∀𝑦 ∈ 𝐴 ¬ 𝑥𝐶𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦𝐶𝑥 → ∃𝑧 ∈ 𝐴 𝑦𝐶𝑧))}
16		df-sup 6977	. 2 ⊢ sup(𝐷, 𝐸, 𝐹) = ∪ {𝑥 ∈ 𝐸 ∣ (∀𝑦 ∈ 𝐷 ¬ 𝑥𝐹𝑦 ∧ ∀𝑦 ∈ 𝐸 (𝑦𝐹𝑥 → ∃𝑧 ∈ 𝐷 𝑦𝐹𝑧))}
17	14, 15, 16	3eqtr4g 2235	1 ⊢ (𝜑 → sup(𝐴, 𝐵, 𝐶) = sup(𝐷, 𝐸, 𝐹))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   = wceq 1353  ∀wral 2455  ∃wrex 2456  {crab 2459  ∪ cuni 3807   class class class wbr 4000  supcsup 6975

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-uni 3808  df-br 4001  df-sup 6977

This theorem is referenced by:  infeq123d  7009