ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  brdomg GIF version

Theorem brdomg 6918
Description: Dominance relation. (Contributed by NM, 15-Jun-1998.)
Assertion
Ref Expression
brdomg (𝐵𝐶 → (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1𝐵))
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓
Allowed substitution hint:   𝐶(𝑓)

Proof of Theorem brdomg
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 reldom 6913 . . . 4 Rel ≼
21brrelex1i 4769 . . 3 (𝐴𝐵𝐴 ∈ V)
32a1i 9 . 2 (𝐵𝐶 → (𝐴𝐵𝐴 ∈ V))
4 f1f 5542 . . . . 5 (𝑓:𝐴1-1𝐵𝑓:𝐴𝐵)
5 fdm 5488 . . . . . 6 (𝑓:𝐴𝐵 → dom 𝑓 = 𝐴)
6 vex 2805 . . . . . . 7 𝑓 ∈ V
76dmex 4999 . . . . . 6 dom 𝑓 ∈ V
85, 7eqeltrrdi 2323 . . . . 5 (𝑓:𝐴𝐵𝐴 ∈ V)
94, 8syl 14 . . . 4 (𝑓:𝐴1-1𝐵𝐴 ∈ V)
109exlimiv 1646 . . 3 (∃𝑓 𝑓:𝐴1-1𝐵𝐴 ∈ V)
1110a1i 9 . 2 (𝐵𝐶 → (∃𝑓 𝑓:𝐴1-1𝐵𝐴 ∈ V))
12 f1eq2 5538 . . . . 5 (𝑥 = 𝐴 → (𝑓:𝑥1-1𝑦𝑓:𝐴1-1𝑦))
1312exbidv 1873 . . . 4 (𝑥 = 𝐴 → (∃𝑓 𝑓:𝑥1-1𝑦 ↔ ∃𝑓 𝑓:𝐴1-1𝑦))
14 f1eq3 5539 . . . . 5 (𝑦 = 𝐵 → (𝑓:𝐴1-1𝑦𝑓:𝐴1-1𝐵))
1514exbidv 1873 . . . 4 (𝑦 = 𝐵 → (∃𝑓 𝑓:𝐴1-1𝑦 ↔ ∃𝑓 𝑓:𝐴1-1𝐵))
16 df-dom 6910 . . . 4 ≼ = {⟨𝑥, 𝑦⟩ ∣ ∃𝑓 𝑓:𝑥1-1𝑦}
1713, 15, 16brabg 4363 . . 3 ((𝐴 ∈ V ∧ 𝐵𝐶) → (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1𝐵))
1817expcom 116 . 2 (𝐵𝐶 → (𝐴 ∈ V → (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1𝐵)))
193, 11, 18pm5.21ndd 712 1 (𝐵𝐶 → (𝐴𝐵 ↔ ∃𝑓 𝑓:𝐴1-1𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1397  wex 1540  wcel 2202  Vcvv 2802   class class class wbr 4088  dom cdm 4725  wf 5322  1-1wf1 5323  cdom 6907
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-cnv 4733  df-dm 4735  df-rn 4736  df-fn 5329  df-f 5330  df-f1 5331  df-dom 6910
This theorem is referenced by:  brdomi  6919  brdom  6920  f1dom2g  6928  f1domg  6930  dom3d  6946  dom1o  7001  phplem4dom  7047  djudom  7291  difinfsn  7298  djudoml  7433  djudomr  7434  nninfdc  13073
  Copyright terms: Public domain W3C validator