MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tz7.48-2 Structured version   Visualization version   GIF version

Theorem tz7.48-2 8371
Description: Proposition 7.48(2) of [TakeutiZaring] p. 51. (Contributed by NM, 9-Feb-1997.) (Revised by David Abernethy, 5-May-2013.)
Hypothesis
Ref Expression
tz7.48.1 𝐹 Fn On
Assertion
Ref Expression
tz7.48-2 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → Fun 𝐹)
Distinct variable group:   𝑥,𝐹
Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem tz7.48-2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ssid 3954 . . 3 On ⊆ On
2 onelon 6340 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑦𝑥) → 𝑦 ∈ On)
32ancoms 458 . . . . . . . 8 ((𝑦𝑥𝑥 ∈ On) → 𝑦 ∈ On)
4 tz7.48.1 . . . . . . . . . . 11 𝐹 Fn On
54fndmi 6594 . . . . . . . . . 10 dom 𝐹 = On
65eleq2i 2826 . . . . . . . . 9 (𝑦 ∈ dom 𝐹𝑦 ∈ On)
7 fnfun 6590 . . . . . . . . . . . . 13 (𝐹 Fn On → Fun 𝐹)
84, 7ax-mp 5 . . . . . . . . . . . 12 Fun 𝐹
9 funfvima 7174 . . . . . . . . . . . 12 ((Fun 𝐹𝑦 ∈ dom 𝐹) → (𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)))
108, 9mpan 690 . . . . . . . . . . 11 (𝑦 ∈ dom 𝐹 → (𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)))
1110impcom 407 . . . . . . . . . 10 ((𝑦𝑥𝑦 ∈ dom 𝐹) → (𝐹𝑦) ∈ (𝐹𝑥))
12 eleq1a 2829 . . . . . . . . . . 11 ((𝐹𝑦) ∈ (𝐹𝑥) → ((𝐹𝑥) = (𝐹𝑦) → (𝐹𝑥) ∈ (𝐹𝑥)))
13 eldifn 4082 . . . . . . . . . . 11 ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ¬ (𝐹𝑥) ∈ (𝐹𝑥))
1412, 13nsyli 157 . . . . . . . . . 10 ((𝐹𝑦) ∈ (𝐹𝑥) → ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ¬ (𝐹𝑥) = (𝐹𝑦)))
1511, 14syl 17 . . . . . . . . 9 ((𝑦𝑥𝑦 ∈ dom 𝐹) → ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ¬ (𝐹𝑥) = (𝐹𝑦)))
166, 15sylan2br 595 . . . . . . . 8 ((𝑦𝑥𝑦 ∈ On) → ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ¬ (𝐹𝑥) = (𝐹𝑦)))
173, 16syldan 591 . . . . . . 7 ((𝑦𝑥𝑥 ∈ On) → ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ¬ (𝐹𝑥) = (𝐹𝑦)))
1817expimpd 453 . . . . . 6 (𝑦𝑥 → ((𝑥 ∈ On ∧ (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → ¬ (𝐹𝑥) = (𝐹𝑦)))
1918com12 32 . . . . 5 ((𝑥 ∈ On ∧ (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → (𝑦𝑥 → ¬ (𝐹𝑥) = (𝐹𝑦)))
2019ralrimiv 3125 . . . 4 ((𝑥 ∈ On ∧ (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → ∀𝑦𝑥 ¬ (𝐹𝑥) = (𝐹𝑦))
2120ralimiaa 3070 . . 3 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ∀𝑥 ∈ On ∀𝑦𝑥 ¬ (𝐹𝑥) = (𝐹𝑦))
224tz7.48lem 8370 . . 3 ((On ⊆ On ∧ ∀𝑥 ∈ On ∀𝑦𝑥 ¬ (𝐹𝑥) = (𝐹𝑦)) → Fun (𝐹 ↾ On))
231, 21, 22sylancr 587 . 2 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → Fun (𝐹 ↾ On))
24 fnrel 6592 . . . . . 6 (𝐹 Fn On → Rel 𝐹)
254, 24ax-mp 5 . . . . 5 Rel 𝐹
265eqimssi 3992 . . . . 5 dom 𝐹 ⊆ On
27 relssres 5979 . . . . 5 ((Rel 𝐹 ∧ dom 𝐹 ⊆ On) → (𝐹 ↾ On) = 𝐹)
2825, 26, 27mp2an 692 . . . 4 (𝐹 ↾ On) = 𝐹
2928cnveqi 5821 . . 3 (𝐹 ↾ On) = 𝐹
3029funeqi 6511 . 2 (Fun (𝐹 ↾ On) ↔ Fun 𝐹)
3123, 30sylib 218 1 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → Fun 𝐹)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1541  wcel 2113  wral 3049  cdif 3896  wss 3899  ccnv 5621  dom cdm 5622  cres 5624  cima 5625  Rel wrel 5627  Oncon0 6315  Fun wfun 6484   Fn wfn 6485  cfv 6490
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-ord 6318  df-on 6319  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fv 6498
This theorem is referenced by:  tz7.48-3  8373  onvf1od  35250
  Copyright terms: Public domain W3C validator