Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  brwitnlem Structured version   Visualization version   GIF version

Theorem brwitnlem 8133
 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.)
Hypotheses
Ref Expression
brwitnlem.r 𝑅 = (𝑂 “ (V ∖ 1o))
brwitnlem.o 𝑂 Fn 𝑋
Assertion
Ref Expression
brwitnlem (𝐴𝑅𝐵 ↔ (𝐴𝑂𝐵) ≠ ∅)

Proof of Theorem brwitnlem
StepHypRef Expression
1 fvex 6668 . . . . 5 (𝑂‘⟨𝐴, 𝐵⟩) ∈ V
2 dif1o 8126 . . . . 5 ((𝑂‘⟨𝐴, 𝐵⟩) ∈ (V ∖ 1o) ↔ ((𝑂‘⟨𝐴, 𝐵⟩) ∈ V ∧ (𝑂‘⟨𝐴, 𝐵⟩) ≠ ∅))
31, 2mpbiran 708 . . . 4 ((𝑂‘⟨𝐴, 𝐵⟩) ∈ (V ∖ 1o) ↔ (𝑂‘⟨𝐴, 𝐵⟩) ≠ ∅)
43anbi2i 625 . . 3 ((⟨𝐴, 𝐵⟩ ∈ 𝑋 ∧ (𝑂‘⟨𝐴, 𝐵⟩) ∈ (V ∖ 1o)) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑋 ∧ (𝑂‘⟨𝐴, 𝐵⟩) ≠ ∅))
5 brwitnlem.o . . . 4 𝑂 Fn 𝑋
6 elpreima 6815 . . . 4 (𝑂 Fn 𝑋 → (⟨𝐴, 𝐵⟩ ∈ (𝑂 “ (V ∖ 1o)) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑋 ∧ (𝑂‘⟨𝐴, 𝐵⟩) ∈ (V ∖ 1o))))
75, 6ax-mp 5 . . 3 (⟨𝐴, 𝐵⟩ ∈ (𝑂 “ (V ∖ 1o)) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑋 ∧ (𝑂‘⟨𝐴, 𝐵⟩) ∈ (V ∖ 1o)))
8 ndmfv 6685 . . . . . 6 (¬ ⟨𝐴, 𝐵⟩ ∈ dom 𝑂 → (𝑂‘⟨𝐴, 𝐵⟩) = ∅)
98necon1ai 3014 . . . . 5 ((𝑂‘⟨𝐴, 𝐵⟩) ≠ ∅ → ⟨𝐴, 𝐵⟩ ∈ dom 𝑂)
105fndmi 6434 . . . . 5 dom 𝑂 = 𝑋
119, 10eleqtrdi 2900 . . . 4 ((𝑂‘⟨𝐴, 𝐵⟩) ≠ ∅ → ⟨𝐴, 𝐵⟩ ∈ 𝑋)
1211pm4.71ri 564 . . 3 ((𝑂‘⟨𝐴, 𝐵⟩) ≠ ∅ ↔ (⟨𝐴, 𝐵⟩ ∈ 𝑋 ∧ (𝑂‘⟨𝐴, 𝐵⟩) ≠ ∅))
134, 7, 123bitr4i 306 . 2 (⟨𝐴, 𝐵⟩ ∈ (𝑂 “ (V ∖ 1o)) ↔ (𝑂‘⟨𝐴, 𝐵⟩) ≠ ∅)
14 brwitnlem.r . . . 4 𝑅 = (𝑂 “ (V ∖ 1o))
1514breqi 5040 . . 3 (𝐴𝑅𝐵𝐴(𝑂 “ (V ∖ 1o))𝐵)
16 df-br 5035 . . 3 (𝐴(𝑂 “ (V ∖ 1o))𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑂 “ (V ∖ 1o)))
1715, 16bitri 278 . 2 (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑂 “ (V ∖ 1o)))
18 df-ov 7148 . . 3 (𝐴𝑂𝐵) = (𝑂‘⟨𝐴, 𝐵⟩)
1918neeq1i 3051 . 2 ((𝐴𝑂𝐵) ≠ ∅ ↔ (𝑂‘⟨𝐴, 𝐵⟩) ≠ ∅)
2013, 17, 193bitr4i 306 1 (𝐴𝑅𝐵 ↔ (𝐴𝑂𝐵) ≠ ∅)
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111   ≠ wne 2987  Vcvv 3442   ∖ cdif 3880  ∅c0 4246  ⟨cop 4534   class class class wbr 5034  ◡ccnv 5522  dom cdm 5523   “ cima 5526   Fn wfn 6327  ‘cfv 6332  (class class class)co 7145  1oc1o 8096 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 5171  ax-nul 5178  ax-pr 5299 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-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3444  df-sbc 3723  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4247  df-if 4429  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4805  df-br 5035  df-opab 5097  df-id 5429  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-rn 5534  df-res 5535  df-ima 5536  df-suc 6172  df-iota 6291  df-fun 6334  df-fn 6335  df-fv 6340  df-ov 7148  df-1o 8103 This theorem is referenced by:  brgic  18422  brric  19513  brlmic  19854  hmph  22422
 Copyright terms: Public domain W3C validator