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 36520

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 5708	. . . . 5 ⊢ (𝑆(V × V)𝐴 ↔ (𝑆 ∈ V ∧ 𝐴 ∈ V))
4	1, 2, 3	mpbir2an 724	. . . 4 ⊢ 𝑆(V × V)𝐴
5		brdif 5162	. . . 4 ⊢ (𝑆((V × V) ∖ ((V ∖ 𝑅) ∘ ^◡ E ))𝐴 ↔ (𝑆(V × V)𝐴 ∧ ¬ 𝑆((V ∖ 𝑅) ∘ ^◡ E )𝐴))
6	4, 5	mpbiran 722	. . 3 ⊢ (𝑆((V × V) ∖ ((V ∖ 𝑅) ∘ ^◡ E ))𝐴 ↔ ¬ 𝑆((V ∖ 𝑅) ∘ ^◡ E )𝐴)
7	1, 2	coepr 36319	. . 3 ⊢ (𝑆((V ∖ 𝑅) ∘ ^◡ E )𝐴 ↔ ∃𝑥 ∈ 𝑆 𝑥(V ∖ 𝑅)𝐴)
8	6, 7	xchbinx 337	. 2 ⊢ (𝑆((V × V) ∖ ((V ∖ 𝑅) ∘ ^◡ E ))𝐴 ↔ ¬ ∃𝑥 ∈ 𝑆 𝑥(V ∖ 𝑅)𝐴)
9		df-ub 36440	. . 3 ⊢ UB𝑅 = ((V × V) ∖ ((V ∖ 𝑅) ∘ ^◡ E ))
10	9	breqi 5113	. 2 ⊢ (𝑆UB𝑅𝐴 ↔ 𝑆((V × V) ∖ ((V ∖ 𝑅) ∘ ^◡ E ))𝐴)
11		brv 5452	. . . . . 6 ⊢ 𝑥V𝐴
12		brdif 5162	. . . . . 6 ⊢ (𝑥(V ∖ 𝑅)𝐴 ↔ (𝑥V𝐴 ∧ ¬ 𝑥𝑅𝐴))
13	11, 12	mpbiran 722	. . . . 5 ⊢ (𝑥(V ∖ 𝑅)𝐴 ↔ ¬ 𝑥𝑅𝐴)
14	13	rexbii 3111	. . . 4 ⊢ (∃𝑥 ∈ 𝑆 𝑥(V ∖ 𝑅)𝐴 ↔ ∃𝑥 ∈ 𝑆 ¬ 𝑥𝑅𝐴)
15		rexnal 3116	. . . 4 ⊢ (∃𝑥 ∈ 𝑆 ¬ 𝑥𝑅𝐴 ↔ ¬ ∀𝑥 ∈ 𝑆 𝑥𝑅𝐴)
16	14, 15	bitri 278	. . 3 ⊢ (∃𝑥 ∈ 𝑆 𝑥(V ∖ 𝑅)𝐴 ↔ ¬ ∀𝑥 ∈ 𝑆 𝑥𝑅𝐴)
17	16	con2bii 360	. 2 ⊢ (∀𝑥 ∈ 𝑆 𝑥𝑅𝐴 ↔ ¬ ∃𝑥 ∈ 𝑆 𝑥(V ∖ 𝑅)𝐴)
18	8, 10, 17	3bitr4i 306	1 ⊢ (𝑆UB𝑅𝐴 ↔ ∀𝑥 ∈ 𝑆 𝑥𝑅𝐴)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 ∈ wcel 2145 ∀wral 3078 ∃wrex 3088 Vcvv 3453 ∖ cdif 3899 class class class wbr 5107 E cep 5558 × cxp 5657 ^◡ccnv 5658 ∘ ccom 5663 UBcub 36416

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 ax-sep 5255 ax-pr 5402

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-eprel 5559 df-xp 5665 df-cnv 5667 df-co 5668 df-ub 36440

This theorem is used by: brlb 36521

W3C validator