Theorem br1cossincnvepres 38451

Description: 𝐵 and 𝐶 are cosets by an intersection with the restricted converse epsilon class: a binary relation. (Contributed by Peter Mazsa, 31-Dec-2021.)

Assertion

Ref	Expression
br1cossincnvepres	⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐵 ≀ (𝑅 ∩ (◡ E ↾ 𝐴))𝐶 ↔ ∃𝑢 ∈ 𝐴 ((𝐵 ∈ 𝑢 ∧ 𝑢𝑅𝐵) ∧ (𝐶 ∈ 𝑢 ∧ 𝑢𝑅𝐶))))

Distinct variable groups:   𝑢,𝐴   𝑢,𝐵   𝑢,𝐶   𝑢,𝑅   𝑢,𝑉   𝑢,𝑊

Proof of Theorem br1cossincnvepres

Step	Hyp	Ref	Expression
1		br1cossinres 38448	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐵 ≀ (𝑅 ∩ (◡ E ↾ 𝐴))𝐶 ↔ ∃𝑢 ∈ 𝐴 ((𝑢◡ E 𝐵 ∧ 𝑢𝑅𝐵) ∧ (𝑢◡ E 𝐶 ∧ 𝑢𝑅𝐶))))
2		brcnvep 38266	. . . . . 6 ⊢ (𝑢 ∈ V → (𝑢◡ E 𝐵 ↔ 𝐵 ∈ 𝑢))
3	2	elv 3485	. . . . 5 ⊢ (𝑢◡ E 𝐵 ↔ 𝐵 ∈ 𝑢)
4	3	anbi1i 624	. . . 4 ⊢ ((𝑢◡ E 𝐵 ∧ 𝑢𝑅𝐵) ↔ (𝐵 ∈ 𝑢 ∧ 𝑢𝑅𝐵))
5		brcnvep 38266	. . . . . 6 ⊢ (𝑢 ∈ V → (𝑢◡ E 𝐶 ↔ 𝐶 ∈ 𝑢))
6	5	elv 3485	. . . . 5 ⊢ (𝑢◡ E 𝐶 ↔ 𝐶 ∈ 𝑢)
7	6	anbi1i 624	. . . 4 ⊢ ((𝑢◡ E 𝐶 ∧ 𝑢𝑅𝐶) ↔ (𝐶 ∈ 𝑢 ∧ 𝑢𝑅𝐶))
8	4, 7	anbi12i 628	. . 3 ⊢ (((𝑢◡ E 𝐵 ∧ 𝑢𝑅𝐵) ∧ (𝑢◡ E 𝐶 ∧ 𝑢𝑅𝐶)) ↔ ((𝐵 ∈ 𝑢 ∧ 𝑢𝑅𝐵) ∧ (𝐶 ∈ 𝑢 ∧ 𝑢𝑅𝐶)))
9	8	rexbii 3094	. 2 ⊢ (∃𝑢 ∈ 𝐴 ((𝑢◡ E 𝐵 ∧ 𝑢𝑅𝐵) ∧ (𝑢◡ E 𝐶 ∧ 𝑢𝑅𝐶)) ↔ ∃𝑢 ∈ 𝐴 ((𝐵 ∈ 𝑢 ∧ 𝑢𝑅𝐵) ∧ (𝐶 ∈ 𝑢 ∧ 𝑢𝑅𝐶)))
10	1, 9	bitrdi 287	1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐵 ≀ (𝑅 ∩ (◡ E ↾ 𝐴))𝐶 ↔ ∃𝑢 ∈ 𝐴 ((𝐵 ∈ 𝑢 ∧ 𝑢𝑅𝐵) ∧ (𝐶 ∈ 𝑢 ∧ 𝑢𝑅𝐶))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∈ wcel 2108  ∃wrex 3070  Vcvv 3480   ∩ cin 3950   class class class wbr 5143   E cep 5583  ^◡ccnv 5684   ↾ cres 5687   ≀ ccoss 38182

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-br 5144  df-opab 5206  df-eprel 5584  df-xp 5691  df-rel 5692  df-cnv 5693  df-res 5697  df-coss 38412

This theorem is referenced by: (None)