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 5386 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝑅𝐵 ↔ 𝜓)) |
6 | 1, 2, 5 | mp2an 691 | 1 ⊢ (𝐴𝑅𝐵 ↔ 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 Vcvv 3441 class class class wbr 5030 {copab 5092 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 |
This theorem is referenced by: frgpuplem 18890 2ndcctbss 22060 legov 26379 prtlem13 36164 wepwsolem 39986 fnwe2val 39993 grumnud 40994 sprsymrelf 44012 |
Copyright terms: Public domain | W3C validator |