Theorem brlb 36153

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

Hypotheses

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

Assertion

Ref	Expression
brlb	⊢ (𝑆LB𝑅𝐴 ↔ ∀𝑥 ∈ 𝑆 𝐴𝑅𝑥)

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

Proof of Theorem brlb

Step	Hyp	Ref	Expression
1		df-lb 36073	. . 3 ⊢ LB𝑅 = UB◡𝑅
2	1	breqi 5092	. 2 ⊢ (𝑆LB𝑅𝐴 ↔ 𝑆UB◡𝑅𝐴)
3		brub.1	. . 3 ⊢ 𝑆 ∈ V
4		brub.2	. . 3 ⊢ 𝐴 ∈ V
5	3, 4	brub 36152	. 2 ⊢ (𝑆UB◡𝑅𝐴 ↔ ∀𝑥 ∈ 𝑆 𝑥◡𝑅𝐴)
6		vex 3434	. . . 4 ⊢ 𝑥 ∈ V
7	6, 4	brcnv 5831	. . 3 ⊢ (𝑥◡𝑅𝐴 ↔ 𝐴𝑅𝑥)
8	7	ralbii 3084	. 2 ⊢ (∀𝑥 ∈ 𝑆 𝑥◡𝑅𝐴 ↔ ∀𝑥 ∈ 𝑆 𝐴𝑅𝑥)
9	2, 5, 8	3bitri 297	1 ⊢ (𝑆LB𝑅𝐴 ↔ ∀𝑥 ∈ 𝑆 𝐴𝑅𝑥)

Syntax hints:   ↔ wb 206   ∈ wcel 2114  ∀wral 3052  Vcvv 3430   class class class wbr 5086  ^◡ccnv 5623  UBcub 36048  LBclb 36049

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-eprel 5524  df-xp 5630  df-cnv 5632  df-co 5633  df-ub 36072  df-lb 36073

This theorem is referenced by: (None)