| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > brwitnlem | Structured version Visualization version GIF version | ||
| Description: Lemma for relations which assert the existence of a witness in a two-parameter set. (Contributed by Stefan O'Rear, 25-Jan-2015.) (Revised by Mario Carneiro, 23-Aug-2015.) |
| Ref | Expression |
|---|---|
| brwitnlem.r | ⊢ 𝑅 = (◡𝑂 “ (V ∖ 1o)) |
| brwitnlem.o | ⊢ 𝑂 Fn 𝑋 |
| Ref | Expression |
|---|---|
| brwitnlem | ⊢ (𝐴𝑅𝐵 ↔ (𝐴𝑂𝐵) ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvex 6891 | . . . . 5 ⊢ (𝑂‘〈𝐴, 𝐵〉) ∈ V | |
| 2 | dif1o 8487 | . . . . 5 ⊢ ((𝑂‘〈𝐴, 𝐵〉) ∈ (V ∖ 1o) ↔ ((𝑂‘〈𝐴, 𝐵〉) ∈ V ∧ (𝑂‘〈𝐴, 𝐵〉) ≠ ∅)) | |
| 3 | 1, 2 | mpbiran 722 | . . . 4 ⊢ ((𝑂‘〈𝐴, 𝐵〉) ∈ (V ∖ 1o) ↔ (𝑂‘〈𝐴, 𝐵〉) ≠ ∅) |
| 4 | 3 | anbi2i 635 | . . 3 ⊢ ((〈𝐴, 𝐵〉 ∈ 𝑋 ∧ (𝑂‘〈𝐴, 𝐵〉) ∈ (V ∖ 1o)) ↔ (〈𝐴, 𝐵〉 ∈ 𝑋 ∧ (𝑂‘〈𝐴, 𝐵〉) ≠ ∅)) |
| 5 | brwitnlem.o | . . . 4 ⊢ 𝑂 Fn 𝑋 | |
| 6 | elpreima 7050 | . . . 4 ⊢ (𝑂 Fn 𝑋 → (〈𝐴, 𝐵〉 ∈ (◡𝑂 “ (V ∖ 1o)) ↔ (〈𝐴, 𝐵〉 ∈ 𝑋 ∧ (𝑂‘〈𝐴, 𝐵〉) ∈ (V ∖ 1o)))) | |
| 7 | 5, 6 | ax-mp 5 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ (◡𝑂 “ (V ∖ 1o)) ↔ (〈𝐴, 𝐵〉 ∈ 𝑋 ∧ (𝑂‘〈𝐴, 𝐵〉) ∈ (V ∖ 1o))) |
| 8 | ndmfv 6910 | . . . . . 6 ⊢ (¬ 〈𝐴, 𝐵〉 ∈ dom 𝑂 → (𝑂‘〈𝐴, 𝐵〉) = ∅) | |
| 9 | 8 | necon1ai 2982 | . . . . 5 ⊢ ((𝑂‘〈𝐴, 𝐵〉) ≠ ∅ → 〈𝐴, 𝐵〉 ∈ dom 𝑂) |
| 10 | 5 | fndmi 6636 | . . . . 5 ⊢ dom 𝑂 = 𝑋 |
| 11 | 9, 10 | eleqtrdi 2870 | . . . 4 ⊢ ((𝑂‘〈𝐴, 𝐵〉) ≠ ∅ → 〈𝐴, 𝐵〉 ∈ 𝑋) |
| 12 | 11 | pm4.71ri 570 | . . 3 ⊢ ((𝑂‘〈𝐴, 𝐵〉) ≠ ∅ ↔ (〈𝐴, 𝐵〉 ∈ 𝑋 ∧ (𝑂‘〈𝐴, 𝐵〉) ≠ ∅)) |
| 13 | 4, 7, 12 | 3bitr4i 306 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (◡𝑂 “ (V ∖ 1o)) ↔ (𝑂‘〈𝐴, 𝐵〉) ≠ ∅) |
| 14 | brwitnlem.r | . . . 4 ⊢ 𝑅 = (◡𝑂 “ (V ∖ 1o)) | |
| 15 | 14 | breqi 5109 | . . 3 ⊢ (𝐴𝑅𝐵 ↔ 𝐴(◡𝑂 “ (V ∖ 1o))𝐵) |
| 16 | df-br 5104 | . . 3 ⊢ (𝐴(◡𝑂 “ (V ∖ 1o))𝐵 ↔ 〈𝐴, 𝐵〉 ∈ (◡𝑂 “ (V ∖ 1o))) | |
| 17 | 15, 16 | bitri 278 | . 2 ⊢ (𝐴𝑅𝐵 ↔ 〈𝐴, 𝐵〉 ∈ (◡𝑂 “ (V ∖ 1o))) |
| 18 | df-ov 7416 | . . 3 ⊢ (𝐴𝑂𝐵) = (𝑂‘〈𝐴, 𝐵〉) | |
| 19 | 18 | neeq1i 3019 | . 2 ⊢ ((𝐴𝑂𝐵) ≠ ∅ ↔ (𝑂‘〈𝐴, 𝐵〉) ≠ ∅) |
| 20 | 13, 17, 19 | 3bitr4i 306 | 1 ⊢ (𝐴𝑅𝐵 ↔ (𝐴𝑂𝐵) ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 Vcvv 3450 ∖ cdif 3896 ∅c0 4279 〈cop 4590 class class class wbr 5103 ◡ccnv 5654 dom cdm 5655 “ cima 5658 Fn wfn 6528 ‘cfv 6533 (class class class)co 7413 1oc1o 8448 |
| 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-10 2178 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 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-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-fv 6541 df-ov 7416 df-1o 8455 |
| This theorem is used by: brgic 19397 brric 20656 brlmic 21252 hmph 24002 brgric 48828 brgrlic 48920 |
| Copyright terms: Public domain | W3C validator |