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

Theorem uniimadomf 10636
Description: An upper bound for the cardinality of the union of an image. Theorem 10.48 of [TakeutiZaring] p. 99. This version of uniimadom 10635 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 1946 . . 3 Ⅎ𝑧(𝐹‘𝑥) ≼ 𝐵
2 uniimadomf.1 . . . . 5 Ⅎ𝑥𝐹
3 nfcv 2922 . . . . 5 Ⅎ𝑥𝑧
42, 3nffv 6900 . . . 4 Ⅎ𝑥(𝐹‘𝑧)
5 nfcv 2922 . . . 4 Ⅎ𝑥 ≼
6 nfcv 2922 . . . 4 Ⅎ𝑥𝐵
74, 5, 6nfbr 5151 . . 3 Ⅎ𝑥(𝐹‘𝑧) ≼ 𝐵
8 fveq2 6890 . . . 4 (𝑥 = 𝑧 → (𝐹‘𝑥) = (𝐹‘𝑧))
98breq1d 5112 . . 3 (𝑥 = 𝑧 → ((𝐹‘𝑥) ≼ 𝐵 ↔ (𝐹‘𝑧) ≼ 𝐵))
101, 7, 9cbvralw 3304 . 2 (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ≼ 𝐵 ↔ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) ≼ 𝐵)
11 uniimadomf.2 . . 3 𝐴 ∈ V
12 uniimadomf.3 . . 3 𝐵 ∈ V
1311, 12uniimadom 10635 . 2 ((Fun 𝐹 ∧ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) ≼ 𝐵) → ∪ (𝐹 “ 𝐴) ≼ (𝐴 × 𝐵))
1410, 13sylan2b 606 1 ((Fun 𝐹 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ≼ 𝐵) → ∪ (𝐹 “ 𝐴) ≼ (𝐴 × 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2144  Ⅎwnfc 2907  ∀wral 3076  Vcvv 3450  ∪ cuni 4866   class class class wbr 5102   × cxp 5649   “ cima 5654  Fun wfun 6537  ‘cfv 6543   ≼ cdom 8979
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755  ax-ac2 10548
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-ord 6368  df-on 6369  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7381  df-ov 7427  df-oprab 7428  df-mpo 7429  df-1st 8005  df-2nd 8006  df-frecs 8307  df-wrecs 8338  df-recs 8387  df-er 8725  df-map 8857  df-en 8982  df-dom 8983  df-card 10027  df-acn 10030  df-ac 10202
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator