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

Theorem uniimadomf 10232
Description: An upper bound for the cardinality of the union of an image. Theorem 10.48 of [TakeutiZaring] p. 99. This version of uniimadom 10231 uses a bound-variable hypothesis in place of a distinct variable condition. (Contributed by NM, 26-Mar-2006.)
Hypotheses
Ref Expression
uniimadomf.1 𝑥𝐹
uniimadomf.2 𝐴 ∈ V
uniimadomf.3 𝐵 ∈ V
Assertion
Ref Expression
uniimadomf ((Fun 𝐹 ∧ ∀𝑥𝐴 (𝐹𝑥) ≼ 𝐵) → (𝐹𝐴) ≼ (𝐴 × 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem uniimadomf
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfv 1918 . . 3 𝑧(𝐹𝑥) ≼ 𝐵
2 uniimadomf.1 . . . . 5 𝑥𝐹
3 nfcv 2906 . . . . 5 𝑥𝑧
42, 3nffv 6766 . . . 4 𝑥(𝐹𝑧)
5 nfcv 2906 . . . 4 𝑥
6 nfcv 2906 . . . 4 𝑥𝐵
74, 5, 6nfbr 5117 . . 3 𝑥(𝐹𝑧) ≼ 𝐵
8 fveq2 6756 . . . 4 (𝑥 = 𝑧 → (𝐹𝑥) = (𝐹𝑧))
98breq1d 5080 . . 3 (𝑥 = 𝑧 → ((𝐹𝑥) ≼ 𝐵 ↔ (𝐹𝑧) ≼ 𝐵))
101, 7, 9cbvralw 3363 . 2 (∀𝑥𝐴 (𝐹𝑥) ≼ 𝐵 ↔ ∀𝑧𝐴 (𝐹𝑧) ≼ 𝐵)
11 uniimadomf.2 . . 3 𝐴 ∈ V
12 uniimadomf.3 . . 3 𝐵 ∈ V
1311, 12uniimadom 10231 . 2 ((Fun 𝐹 ∧ ∀𝑧𝐴 (𝐹𝑧) ≼ 𝐵) → (𝐹𝐴) ≼ (𝐴 × 𝐵))
1410, 13sylan2b 593 1 ((Fun 𝐹 ∧ ∀𝑥𝐴 (𝐹𝑥) ≼ 𝐵) → (𝐹𝐴) ≼ (𝐴 × 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2108  wnfc 2886  wral 3063  Vcvv 3422   cuni 4836   class class class wbr 5070   × cxp 5578  cima 5583  Fun wfun 6412  cfv 6418  cdom 8689
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-ac2 10150
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-se 5536  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-isom 6427  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-er 8456  df-map 8575  df-en 8692  df-dom 8693  df-card 9628  df-acn 9631  df-ac 9803
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator