HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem dom2d 3307
Description: A mapping (first hypothesis) that is one-to-one (second hypothesis) implies its domain is dominated by its range.
Hypotheses
Ref Expression
dom2d.1 (φ → (xACB))
dom2d.2 (φ → ((xAyA) → (C = Dx = y)))
Assertion
Ref Expression
dom2d (φ → (ARAB))
Distinct variable group(s):   x,y,A   x,B,y   y,C   x,D   φ,x,y

Proof of Theorem dom2d
StepHypRef Expression
1 f1domg 3299 . . 3 (AR → ({⟨x, y⟩∣(xAy = C)}:A1-1BAB))
2 dom2d.1 . . . . . . 7 (φ → (xACB))
32r19.21aiv 1259 . . . . . 6 (φ → ∀xA CB)
4 cleqid 1102 . . . . . . 7 {⟨x, y⟩∣(xAy = C)} = {⟨x, y⟩∣(xAy = C)}
54fopab2 2891 . . . . . 6 (∀xA CB ↔ {⟨x, y⟩∣(xAy = C)}:A–→B)
63, 5sylib 173 . . . . 5 (φ → {⟨x, y⟩∣(xAy = C)}:A–→B)
72imp 277 . . . . . . . . . . 11 ((φxA) → CB)
8 fvopab2 2878 . . . . . . . . . . . 12 ((xACB) → ({⟨x, y⟩∣(xAy = C)} ‘x) = C)
98adantll 309 . . . . . . . . . . 11 (((φxA) ∧ CB) → ({⟨x, y⟩∣(xAy = C)} ‘x) = C)
107, 9mpdan 527 . . . . . . . . . 10 ((φxA) → ({⟨x, y⟩∣(xAy = C)} ‘x) = C)
1110adantrr 312 . . . . . . . . 9 ((φ ∧ (xAyA)) → ({⟨x, y⟩∣(xAy = C)} ‘x) = C)
12 ax-17 925 . . . . . . . . . . . 12 ((φyA) → ∀x(φyA))
13 hbopab1 2112 . . . . . . . . . . . . . 14 (z ∈ {⟨x, y⟩∣(xAy = C)} → ∀x z ∈ {⟨x, y⟩∣(xAy = C)})
14 ax-17 925 . . . . . . . . . . . . . 14 (zy → ∀x zy)
1513, 14hbfv 2837 . . . . . . . . . . . . 13 (z ∈ ({⟨x, y⟩∣(xAy = C)} ‘y) → ∀x z ∈ ({⟨x, y⟩∣(xAy = C)} ‘y))
16 ax-17 925 . . . . . . . . . . . . 13 (zD → ∀x zD)
1715, 16hbeq 1171 . . . . . . . . . . . 12 (({⟨x, y⟩∣(xAy = C)} ‘y) = D → ∀x({⟨x, y⟩∣(xAy = C)} ‘y) = D)
1812, 17hbim 702 . . . . . . . . . . 11 (((φyA) → ({⟨x, y⟩∣(xAy = C)} ‘y) = D) → ∀x((φyA) → ({⟨x, y⟩∣(xAy = C)} ‘y) = D))
19 eleq1 1149 . . . . . . . . . . . . . 14 (x = y → (xAyA))
2019anbi2d 468 . . . . . . . . . . . . 13 (x = y → ((φxA) ↔ (φyA)))
2120imbi1d 465 . . . . . . . . . . . 12 (x = y → (((φxA) → ({⟨x, y⟩∣(xAy = C)} ‘x) = C) ↔ ((φyA) → ({⟨x, y⟩∣(xAy = C)} ‘x) = C)))
2219anbi1d 469 . . . . . . . . . . . . . . . 16 (x = y → ((xAyA) ↔ (yAyA)))
23 anidm 331 . . . . . . . . . . . . . . . 16 ((yAyA) ↔ yA)
2422, 23syl6bb 414 . . . . . . . . . . . . . . 15 (x = y → ((xAyA) ↔ yA))
2524anbi2d 468 . . . . . . . . . . . . . 14 (x = y → ((φ ∧ (xAyA)) ↔ (φyA)))
26 fveq2 2832 . . . . . . . . . . . . . . . . 17 (x = y → ({⟨x, y⟩∣(xAy = C)} ‘x) = ({⟨x, y⟩∣(xAy = C)} ‘y))
2726adantr 306 . . . . . . . . . . . . . . . 16 ((x = y ∧ (φ ∧ (xAyA))) → ({⟨x, y⟩∣(xAy = C)} ‘x) = ({⟨x, y⟩∣(xAy = C)} ‘y))
28 dom2d.2 . . . . . . . . . . . . . . . . . 18 (φ → ((xAyA) → (C = Dx = y)))
2928imp 277 . . . . . . . . . . . . . . . . 17 ((φ ∧ (xAyA)) → (C = Dx = y))
3029biimparc 327 . . . . . . . . . . . . . . . 16 ((x = y ∧ (φ ∧ (xAyA))) → C = D)
3127, 30cleq12d 1115 . . . . . . . . . . . . . . 15 ((x = y ∧ (φ ∧ (xAyA))) → (({⟨x, y⟩∣(xAy = C)} ‘x) = C ↔ ({⟨x, y⟩∣(xAy = C)} ‘y) = D))
3231exp 291 . . . . . . . . . . . . . 14 (x = y → ((φ ∧ (xAyA)) → (({⟨x, y⟩∣(xAy = C)} ‘x) = C ↔ ({⟨x, y⟩∣(xAy = C)} ‘y) = D)))
3325, 32sylbird 180 . . . . . . . . . . . . 13 (x = y → ((φyA) → (({⟨x, y⟩∣(xAy = C)} ‘x) = C ↔ ({⟨x, y⟩∣(xAy = C)} ‘y) = D)))
3433pm5.74d 444 . . . . . . . . . . . 12 (x = y → (((φyA) → ({⟨x, y⟩∣(xAy = C)} ‘x) = C) ↔ ((φyA) → ({⟨x, y⟩∣(xAy = C)} ‘y) = D)))
3521, 34bitrd 406 . . . . . . . . . . 11 (x = y → (((φxA) → ({⟨x, y⟩∣(xAy = C)} ‘x) = C) ↔ ((φyA) → ({⟨x, y⟩∣(xAy = C)} ‘y) = D)))
3618, 35, 10chv2 850 . . . . . . . . . 10 ((φyA) → ({⟨x, y⟩∣(xAy = C)} ‘y) = D)
3736adantrl 311 . . . . . . . . 9 ((φ ∧ (xAyA)) → ({⟨x, y⟩∣(xAy = C)} ‘y) = D)
3811, 37cleq12d 1115 . . . . . . . 8 ((φ ∧ (xAyA)) → (({⟨x, y⟩∣(xAy = C)} ‘x) = ({⟨x, y⟩∣(xAy = C)} ‘y) ↔ C = D))
3929biimpd 135 . . . . . . . 8 ((φ ∧ (xAyA)) → (C = Dx = y))
4038, 39sylbid 178 . . . . . . 7 ((φ ∧ (xAyA)) → (({⟨x, y⟩∣(xAy = C)} ‘x) = ({⟨x, y⟩∣(xAy = C)} ‘y) → x = y))
4140exp 291 . . . . . 6 (φ → ((xAyA) → (({⟨x, y⟩∣(xAy = C)} ‘x) = ({⟨x, y⟩∣(xAy = C)} ‘y) → x = y)))
4241r19.21aivv 1263 . . . . 5 (φ → ∀xAyA (({⟨x, y⟩∣(xAy = C)} ‘x) = ({⟨x, y⟩∣(xAy = C)} ‘y) → x = y))
436, 42jca 236 . . . 4 (φ → ({⟨x, y⟩∣(xAy = C)}:A–→B ∧ ∀xAyA (({⟨x, y⟩∣(xAy = C)} ‘x) = ({⟨x, y⟩∣(xAy = C)} ‘y) → x = y)))
44 hbopab2 2113 . . . . 5 (z ∈ {⟨x, y⟩∣(xAy = C)} → ∀y z ∈ {⟨x, y⟩∣(xAy = C)})
4513, 44f1fvf 2917 . . . 4 ({⟨x, y⟩∣(xAy = C)}:A1-1B ↔ ({⟨x, y⟩∣(xAy = C)}:A–→B ∧ ∀xAyA (({⟨x, y⟩∣(xAy = C)} ‘x) = ({⟨x, y⟩∣(xAy = C)} ‘y) → x = y)))
4643, 45sylibr 175 . . 3 (φ → {⟨x, y⟩∣(xAy = C)}:A1-1B)
471, 46syl5 22 . 2 (AR → (φAB))
4847com12 13 1 (φ → (ARAB))
Colors of variables: wff set class
Syntax hints:   → wi 2   ↔ wb 127   ∧ wa 196   = weq 797   ∈ wel 803   = wceq 1091   ∈ wcel 1092  ∀wral 1201   class class class wbr 2054  {copab 2055  –→wf 2418  –1-1wf1 2419   ‘cfv 2422   ≼ cdom 3272
This theorem is referenced by:  dom2 3308  xpdom2 3345  mapdom2 3389  infmap2lem2 4952
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-br 2063  df-opab 2098  df-id 2125  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fo 2436  df-f1o 2437  df-fv 2438  df-en 3274  df-dom 3275
metamath.org