Theorem dfsup2 9203

Description: Quantifier-free definition of supremum. (Contributed by Scott Fenton, 19-Feb-2013.)

Assertion

Ref	Expression
dfsup2	⊢ sup(𝐵, 𝐴, 𝑅) = ∪ (𝐴 ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))

Proof of Theorem dfsup2

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-sup 9201	. 2 ⊢ sup(𝐵, 𝐴, 𝑅) = ∪ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))}
2		dfrab3 4243	. . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} = (𝐴 ∩ {𝑥 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))})
3		abeq1 2873	. . . . . . 7 ⊢ ({𝑥 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} = (V ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵))))) ↔ ∀𝑥((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ↔ 𝑥 ∈ (V ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))))
4		vex 3436	. . . . . . . . 9 ⊢ 𝑥 ∈ V
5		eldif 3897	. . . . . . . . 9 ⊢ (𝑥 ∈ (V ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵))))) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵))))))
6	4, 5	mpbiran 706	. . . . . . . 8 ⊢ (𝑥 ∈ (V ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵))))) ↔ ¬ 𝑥 ∈ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))
7	4	elima 5974	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (◡𝑅 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 𝑦◡𝑅𝑥)
8		dfrex2 3170	. . . . . . . . . . . 12 ⊢ (∃𝑦 ∈ 𝐵 𝑦◡𝑅𝑥 ↔ ¬ ∀𝑦 ∈ 𝐵 ¬ 𝑦◡𝑅𝑥)
9	7, 8	bitri 274	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (◡𝑅 “ 𝐵) ↔ ¬ ∀𝑦 ∈ 𝐵 ¬ 𝑦◡𝑅𝑥)
10	4	elima 5974	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵))) ↔ ∃𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵))𝑦𝑅𝑥)
11		dfrex2 3170	. . . . . . . . . . . 12 ⊢ (∃𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵))𝑦𝑅𝑥 ↔ ¬ ∀𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) ¬ 𝑦𝑅𝑥)
12	10, 11	bitri 274	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵))) ↔ ¬ ∀𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) ¬ 𝑦𝑅𝑥)
13	9, 12	orbi12i 912	. . . . . . . . . 10 ⊢ ((𝑥 ∈ (◡𝑅 “ 𝐵) ∨ 𝑥 ∈ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))) ↔ (¬ ∀𝑦 ∈ 𝐵 ¬ 𝑦◡𝑅𝑥 ∨ ¬ ∀𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) ¬ 𝑦𝑅𝑥))
14		elun 4083	. . . . . . . . . 10 ⊢ (𝑥 ∈ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))) ↔ (𝑥 ∈ (◡𝑅 “ 𝐵) ∨ 𝑥 ∈ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))
15		ianor 979	. . . . . . . . . 10 ⊢ (¬ (∀𝑦 ∈ 𝐵 ¬ 𝑦◡𝑅𝑥 ∧ ∀𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) ¬ 𝑦𝑅𝑥) ↔ (¬ ∀𝑦 ∈ 𝐵 ¬ 𝑦◡𝑅𝑥 ∨ ¬ ∀𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) ¬ 𝑦𝑅𝑥))
16	13, 14, 15	3bitr4i 303	. . . . . . . . 9 ⊢ (𝑥 ∈ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))) ↔ ¬ (∀𝑦 ∈ 𝐵 ¬ 𝑦◡𝑅𝑥 ∧ ∀𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) ¬ 𝑦𝑅𝑥))
17	16	con2bii 358	. . . . . . . 8 ⊢ ((∀𝑦 ∈ 𝐵 ¬ 𝑦◡𝑅𝑥 ∧ ∀𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) ¬ 𝑦𝑅𝑥) ↔ ¬ 𝑥 ∈ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))
18		vex 3436	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
19	18, 4	brcnv 5791	. . . . . . . . . . 11 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦)
20	19	notbii 320	. . . . . . . . . 10 ⊢ (¬ 𝑦◡𝑅𝑥 ↔ ¬ 𝑥𝑅𝑦)
21	20	ralbii 3092	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐵 ¬ 𝑦◡𝑅𝑥 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦)
22		impexp 451	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ (◡𝑅 “ 𝐵)) → ¬ 𝑦𝑅𝑥) ↔ (𝑦 ∈ 𝐴 → (¬ 𝑦 ∈ (◡𝑅 “ 𝐵) → ¬ 𝑦𝑅𝑥)))
23		eldif 3897	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) ↔ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ (◡𝑅 “ 𝐵)))
24	23	imbi1i 350	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) → ¬ 𝑦𝑅𝑥) ↔ ((𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ (◡𝑅 “ 𝐵)) → ¬ 𝑦𝑅𝑥))
25	18	elima 5974	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ (◡𝑅 “ 𝐵) ↔ ∃𝑧 ∈ 𝐵 𝑧◡𝑅𝑦)
26		vex 3436	. . . . . . . . . . . . . . . . 17 ⊢ 𝑧 ∈ V
27	26, 18	brcnv 5791	. . . . . . . . . . . . . . . 16 ⊢ (𝑧◡𝑅𝑦 ↔ 𝑦𝑅𝑧)
28	27	rexbii 3181	. . . . . . . . . . . . . . 15 ⊢ (∃𝑧 ∈ 𝐵 𝑧◡𝑅𝑦 ↔ ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)
29	25, 28	bitri 274	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ (◡𝑅 “ 𝐵) ↔ ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)
30	29	imbi2i 336	. . . . . . . . . . . . 13 ⊢ ((𝑦𝑅𝑥 → 𝑦 ∈ (◡𝑅 “ 𝐵)) ↔ (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))
31		con34b 316	. . . . . . . . . . . . 13 ⊢ ((𝑦𝑅𝑥 → 𝑦 ∈ (◡𝑅 “ 𝐵)) ↔ (¬ 𝑦 ∈ (◡𝑅 “ 𝐵) → ¬ 𝑦𝑅𝑥))
32	30, 31	bitr3i 276	. . . . . . . . . . . 12 ⊢ ((𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧) ↔ (¬ 𝑦 ∈ (◡𝑅 “ 𝐵) → ¬ 𝑦𝑅𝑥))
33	32	imbi2i 336	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ 𝐴 → (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ↔ (𝑦 ∈ 𝐴 → (¬ 𝑦 ∈ (◡𝑅 “ 𝐵) → ¬ 𝑦𝑅𝑥)))
34	22, 24, 33	3bitr4i 303	. . . . . . . . . 10 ⊢ ((𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) → ¬ 𝑦𝑅𝑥) ↔ (𝑦 ∈ 𝐴 → (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
35	34	ralbii2 3090	. . . . . . . . 9 ⊢ (∀𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) ¬ 𝑦𝑅𝑥 ↔ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))
36	21, 35	anbi12i 627	. . . . . . . 8 ⊢ ((∀𝑦 ∈ 𝐵 ¬ 𝑦◡𝑅𝑥 ∧ ∀𝑦 ∈ (𝐴 ∖ (◡𝑅 “ 𝐵)) ¬ 𝑦𝑅𝑥) ↔ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)))
37	6, 17, 36	3bitr2ri 300	. . . . . . 7 ⊢ ((∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧)) ↔ 𝑥 ∈ (V ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵))))))
38	3, 37	mpgbir 1802	. . . . . 6 ⊢ {𝑥 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} = (V ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))
39	38	ineq2i 4143	. . . . 5 ⊢ (𝐴 ∩ {𝑥 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))}) = (𝐴 ∩ (V ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵))))))
40		invdif 4202	. . . . 5 ⊢ (𝐴 ∩ (V ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))) = (𝐴 ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))
41	39, 40	eqtri 2766	. . . 4 ⊢ (𝐴 ∩ {𝑥 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))}) = (𝐴 ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))
42	2, 41	eqtri 2766	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} = (𝐴 ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))
43	42	unieqi 4852	. 2 ⊢ ∪ {𝑥 ∈ 𝐴 ∣ (∀𝑦 ∈ 𝐵 ¬ 𝑥𝑅𝑦 ∧ ∀𝑦 ∈ 𝐴 (𝑦𝑅𝑥 → ∃𝑧 ∈ 𝐵 𝑦𝑅𝑧))} = ∪ (𝐴 ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))
44	1, 43	eqtri 2766	1 ⊢ sup(𝐵, 𝐴, 𝑅) = ∪ (𝐴 ∖ ((◡𝑅 “ 𝐵) ∪ (𝑅 “ (𝐴 ∖ (◡𝑅 “ 𝐵)))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 844   = wceq 1539   ∈ wcel 2106  {cab 2715  ∀wral 3064  ∃wrex 3065  {crab 3068  Vcvv 3432   ∖ cdif 3884   ∪ cun 3885   ∩ cin 3886  ∪ cuni 4839   class class class wbr 5074  ^◡ccnv 5588   “ cima 5592  supcsup 9199

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-xp 5595  df-cnv 5597  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-sup 9201

This theorem is referenced by:  nfsup  9210