| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > braba | Structured version Visualization version GIF version | ||
| Description: The law of concretion for a binary relation. (Contributed by NM, 19-Dec-2013.) |
| Ref | Expression |
|---|---|
| opelopaba.1 | ⊢ 𝐴 ∈ V |
| opelopaba.2 | ⊢ 𝐵 ∈ V |
| opelopaba.3 | ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓)) |
| braba.4 | ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝜑} |
| Ref | Expression |
|---|---|
| braba | ⊢ (𝐴𝑅𝐵 ↔ 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opelopaba.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | opelopaba.2 | . 2 ⊢ 𝐵 ∈ V | |
| 3 | opelopaba.3 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓)) | |
| 4 | braba.4 | . . 3 ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝜑} | |
| 5 | 3, 4 | brabga 5515 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝑅𝐵 ↔ 𝜓)) |
| 6 | 1, 2, 5 | mp2an 705 | 1 ⊢ (𝐴𝑅𝐵 ↔ 𝜓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 class class class wbr 5108 {copab 5173 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5255 ax-pr 5398 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 |
| This theorem is used by: fnwe2lem1 8182 frgpuplem 20037 2ndcctbss 23829 legov 29105 prtlem13 40191 wepwsolem 44315 grumnud 45592 lambert0 48271 lamberte 48272 sinnpoly 48275 sprsymrelf 48911 catprsc 50519 catprsc2 50520 |
| Copyright terms: Public domain | W3C validator |