brub - Mathbox for Scott Fenton

	Mathbox for Scott Fenton		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > brub		Structured version Visualization version GIF version

Theorem brub 36309

Description: Binary relation form of the upper bound functor. (Contributed by Scott Fenton, 3-May-2018.)

**Hypotheses**
Ref	Expression
brub.1	⊢ 𝑆 ∈ V
brub.2	⊢ 𝐴 ∈ V

**Assertion**
Ref	Expression
brub	⊢ (𝑆UB𝑅𝐴 ↔ ∀𝑥 ∈ 𝑆 𝑥𝑅𝐴)

Distinct variable groups: 𝑥,𝐴 𝑥,𝑅 𝑥,𝑆

**Proof of Theorem brub**
Step	Hyp	Ref	Expression
1		brub.1	. . . . 5 ⊢ 𝑆 ∈ V
2		brub.2	. . . . 5 ⊢ 𝐴 ∈ V
3		brxp 5698	. . . . 5 ⊢ (𝑆(V × V)𝐴 ↔ (𝑆 ∈ V ∧ 𝐴 ∈ V))
4	1, 2, 3	mpbir2an 721	. . . 4 ⊢ 𝑆(V × V)𝐴
5		brdif 5155	. . . 4 ⊢ (𝑆((V × V) ∖ ((V ∖ 𝑅) ∘ ^◡ E ))𝐴 ↔ (𝑆(V × V)𝐴 ∧ ¬ 𝑆((V ∖ 𝑅) ∘ ^◡ E )𝐴))
6	4, 5	mpbiran 719	. . 3 ⊢ (𝑆((V × V) ∖ ((V ∖ 𝑅) ∘ ^◡ E ))𝐴 ↔ ¬ 𝑆((V ∖ 𝑅) ∘ ^◡ E )𝐴)
7	1, 2	coepr 36108	. . 3 ⊢ (𝑆((V ∖ 𝑅) ∘ ^◡ E )𝐴 ↔ ∃𝑥 ∈ 𝑆 𝑥(V ∖ 𝑅)𝐴)
8	6, 7	xchbinx 336	. 2 ⊢ (𝑆((V × V) ∖ ((V ∖ 𝑅) ∘ ^◡ E ))𝐴 ↔ ¬ ∃𝑥 ∈ 𝑆 𝑥(V ∖ 𝑅)𝐴)
9		df-ub 36229	. . 3 ⊢ UB𝑅 = ((V × V) ∖ ((V ∖ 𝑅) ∘ ^◡ E ))
10	9	breqi 5108	. 2 ⊢ (𝑆UB𝑅𝐴 ↔ 𝑆((V × V) ∖ ((V ∖ 𝑅) ∘ ^◡ E ))𝐴)
11		brv 5442	. . . . . 6 ⊢ 𝑥V𝐴
12		brdif 5155	. . . . . 6 ⊢ (𝑥(V ∖ 𝑅)𝐴 ↔ (𝑥V𝐴 ∧ ¬ 𝑥𝑅𝐴))
13	11, 12	mpbiran 719	. . . . 5 ⊢ (𝑥(V ∖ 𝑅)𝐴 ↔ ¬ 𝑥𝑅𝐴)
14	13	rexbii 3111	. . . 4 ⊢ (∃𝑥 ∈ 𝑆 𝑥(V ∖ 𝑅)𝐴 ↔ ∃𝑥 ∈ 𝑆 ¬ 𝑥𝑅𝐴)
15		rexnal 3116	. . . 4 ⊢ (∃𝑥 ∈ 𝑆 ¬ 𝑥𝑅𝐴 ↔ ¬ ∀𝑥 ∈ 𝑆 𝑥𝑅𝐴)
16	14, 15	bitri 277	. . 3 ⊢ (∃𝑥 ∈ 𝑆 𝑥(V ∖ 𝑅)𝐴 ↔ ¬ ∀𝑥 ∈ 𝑆 𝑥𝑅𝐴)
17	16	con2bii 359	. 2 ⊢ (∀𝑥 ∈ 𝑆 𝑥𝑅𝐴 ↔ ¬ ∃𝑥 ∈ 𝑆 𝑥(V ∖ 𝑅)𝐴)
18	8, 10, 17	3bitr4i 305	1 ⊢ (𝑆UB𝑅𝐴 ↔ ∀𝑥 ∈ 𝑆 𝑥𝑅𝐴)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 ↔ wb 208 ∈ wcel 2144 ∀wral 3078 ∃wrex 3088 Vcvv 3456 ∖ cdif 3903 class class class wbr 5102 E cep 5548 × cxp 5647 ^◡ccnv 5648 ∘ ccom 5653 UBcub 36205

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 ax-sep 5248 ax-pr 5392

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ne 2960 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-br 5103 df-opab 5165 df-eprel 5549 df-xp 5655 df-cnv 5657 df-co 5658 df-ub 36229

This theorem is referenced by: brlb 36310

W3C validator