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

Theorem brwdom 9598
Description: Property of weak dominance (definitional form). (Contributed by Stefan O'Rear, 11-Feb-2015.)
Assertion
Ref Expression
brwdom (𝑌 ∈ 𝑉 → (𝑋 ≼* 𝑌 ↔ (𝑋 = ∅ ∨ ∃𝑧 𝑧:𝑌⟶onto𝑋)))
Distinct variable groups:   𝑧,𝑋   𝑧,𝑌
Allowed substitution hint:   𝑉(𝑧)

Proof of Theorem brwdom
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3475 . 2 (𝑌 ∈ 𝑉 → 𝑌 ∈ V)
2 relwdom 9597 . . . . 5 Rel ≼*
32brrelex1i 5714 . . . 4 (𝑋 ≼* 𝑌 → 𝑋 ∈ V)
43a1i 11 . . 3 (𝑌 ∈ V → (𝑋 ≼* 𝑌 → 𝑋 ∈ V))
5 0ex 5267 . . . . . 6 ∅ ∈ V
6 eleq1a 2859 . . . . . 6 (∅ ∈ V → (𝑋 = ∅ → 𝑋 ∈ V))
75, 6ax-mp 5 . . . . 5 (𝑋 = ∅ → 𝑋 ∈ V)
8 forn 6829 . . . . . . 7 (𝑧:𝑌⟶onto𝑋 → ran 𝑧 = 𝑋)
9 vex 3458 . . . . . . . 8 𝑧 ∈ V
109rnex 7956 . . . . . . 7 ran 𝑧 ∈ V
118, 10eqeltrrdi 2873 . . . . . 6 (𝑧:𝑌⟶onto𝑋 → 𝑋 ∈ V)
1211exlimiv 1965 . . . . 5 (∃𝑧 𝑧:𝑌⟶onto𝑋 → 𝑋 ∈ V)
137, 12jaoi 871 . . . 4 ((𝑋 = ∅ ∨ ∃𝑧 𝑧:𝑌⟶onto𝑋) → 𝑋 ∈ V)
1413a1i 11 . . 3 (𝑌 ∈ V → ((𝑋 = ∅ ∨ ∃𝑧 𝑧:𝑌⟶onto𝑋) → 𝑋 ∈ V))
15 eqeq1 2767 . . . . . 6 (𝑥 = 𝑋 → (𝑥 = ∅ ↔ 𝑋 = ∅))
16 foeq3 6824 . . . . . . 7 (𝑥 = 𝑋 → (𝑧:𝑦⟶onto𝑥 ↔ 𝑧:𝑦⟶onto𝑋))
1716exbidv 1956 . . . . . 6 (𝑥 = 𝑋 → (∃𝑧 𝑧:𝑦⟶onto𝑥 ↔ ∃𝑧 𝑧:𝑦⟶onto𝑋))
1815, 17orbi12d 932 . . . . 5 (𝑥 = 𝑋 → ((𝑥 = ∅ ∨ ∃𝑧 𝑧:𝑦⟶onto𝑥) ↔ (𝑋 = ∅ ∨ ∃𝑧 𝑧:𝑦⟶onto𝑋)))
19 foeq2 6823 . . . . . . 7 (𝑦 = 𝑌 → (𝑧:𝑦⟶onto𝑋 ↔ 𝑧:𝑌⟶onto𝑋))
2019exbidv 1956 . . . . . 6 (𝑦 = 𝑌 → (∃𝑧 𝑧:𝑦⟶onto𝑋 ↔ ∃𝑧 𝑧:𝑌⟶onto𝑋))
2120orbi2d 929 . . . . 5 (𝑦 = 𝑌 → ((𝑋 = ∅ ∨ ∃𝑧 𝑧:𝑦⟶onto𝑋) ↔ (𝑋 = ∅ ∨ ∃𝑧 𝑧:𝑌⟶onto𝑋)))
22 df-wdom 9596 . . . . 5 ≼* = {⟨𝑥, 𝑦⟩ ∣ (𝑥 = ∅ ∨ ∃𝑧 𝑧:𝑦⟶onto𝑥)}
2318, 21, 22brabg 5521 . . . 4 ((𝑋 ∈ V ∧ 𝑌 ∈ V) → (𝑋 ≼* 𝑌 ↔ (𝑋 = ∅ ∨ ∃𝑧 𝑧:𝑌⟶onto𝑋)))
2423expcom 419 . . 3 (𝑌 ∈ V → (𝑋 ∈ V → (𝑋 ≼* 𝑌 ↔ (𝑋 = ∅ ∨ ∃𝑧 𝑧:𝑌⟶onto𝑋))))
254, 14, 24pm5.21ndd 382 . 2 (𝑌 ∈ V → (𝑋 ≼* 𝑌 ↔ (𝑋 = ∅ ∨ ∃𝑧 𝑧:𝑌⟶onto𝑋)))
261, 25syl 18 1 (𝑌 ∈ 𝑉 → (𝑋 ≼* 𝑌 ↔ (𝑋 = ∅ ∨ ∃𝑧 𝑧:𝑌⟶onto𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∨ wo 861   = wceq 1570  ∃wex 1812   ∈ wcel 2147  Vcvv 3454  ∅c0 4281   class class class wbr 5108  ran crn 5659  ⟶ontowfo 6564   ≼* cwdom 9595
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-nul 5266  ax-pr 5398  ax-un 7783
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-ral 3081  df-rex 3091  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-uni 4873  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-dm 5668  df-rn 5669  df-fn 6569  df-fo 6572  df-wdom 9596
This theorem is used by:  brwdomi  9599  brwdomn0  9600  0wdom  9601  fowdom  9602  domwdom  9605  wdomnumr  10182
  Copyright terms: Public domain W3C validator