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 8465
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 3988 . . 3 On ⊆ On
2 onelon 6390 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑦𝑥) → 𝑦 ∈ On)
32ancoms 458 . . . . . . . 8 ((𝑦𝑥𝑥 ∈ On) → 𝑦 ∈ On)
4 tz7.48.1 . . . . . . . . . . 11 𝐹 Fn On
54fndmi 6653 . . . . . . . . . 10 dom 𝐹 = On
65eleq2i 2825 . . . . . . . . 9 (𝑦 ∈ dom 𝐹𝑦 ∈ On)
7 fnfun 6649 . . . . . . . . . . . . 13 (𝐹 Fn On → Fun 𝐹)
84, 7ax-mp 5 . . . . . . . . . . . 12 Fun 𝐹
9 funfvima 7233 . . . . . . . . . . . 12 ((Fun 𝐹𝑦 ∈ dom 𝐹) → (𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)))
108, 9mpan 690 . . . . . . . . . . 11 (𝑦 ∈ dom 𝐹 → (𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)))
1110impcom 407 . . . . . . . . . 10 ((𝑦𝑥𝑦 ∈ dom 𝐹) → (𝐹𝑦) ∈ (𝐹𝑥))
12 eleq1a 2828 . . . . . . . . . . 11 ((𝐹𝑦) ∈ (𝐹𝑥) → ((𝐹𝑥) = (𝐹𝑦) → (𝐹𝑥) ∈ (𝐹𝑥)))
13 eldifn 4114 . . . . . . . . . . 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 3132 . . . 4 ((𝑥 ∈ On ∧ (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → ∀𝑦𝑥 ¬ (𝐹𝑥) = (𝐹𝑦))
2120ralimiaa 3071 . . 3 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ∀𝑥 ∈ On ∀𝑦𝑥 ¬ (𝐹𝑥) = (𝐹𝑦))
224tz7.48lem 8464 . . 3 ((On ⊆ On ∧ ∀𝑥 ∈ On ∀𝑦𝑥 ¬ (𝐹𝑥) = (𝐹𝑦)) → Fun (𝐹 ↾ On))
231, 21, 22sylancr 587 . 2 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → Fun (𝐹 ↾ On))
24 fnrel 6651 . . . . . 6 (𝐹 Fn On → Rel 𝐹)
254, 24ax-mp 5 . . . . 5 Rel 𝐹
265eqimssi 4026 . . . . 5 dom 𝐹 ⊆ On
27 relssres 6022 . . . . 5 ((Rel 𝐹 ∧ dom 𝐹 ⊆ On) → (𝐹 ↾ On) = 𝐹)
2825, 26, 27mp2an 692 . . . 4 (𝐹 ↾ On) = 𝐹
2928cnveqi 5867 . . 3 (𝐹 ↾ On) = 𝐹
3029funeqi 6568 . 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 1539  wcel 2107  wral 3050  cdif 3930  wss 3933  ccnv 5666  dom cdm 5667  cres 5669  cima 5670  Rel wrel 5672  Oncon0 6365  Fun wfun 6536   Fn wfn 6537  cfv 6542
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-sep 5278  ax-nul 5288  ax-pr 5414
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3421  df-v 3466  df-dif 3936  df-un 3938  df-in 3940  df-ss 3950  df-pss 3953  df-nul 4316  df-if 4508  df-pw 4584  df-sn 4609  df-pr 4611  df-op 4615  df-uni 4890  df-br 5126  df-opab 5188  df-tr 5242  df-id 5560  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5673  df-rel 5674  df-cnv 5675  df-co 5676  df-dm 5677  df-rn 5678  df-res 5679  df-ima 5680  df-ord 6368  df-on 6369  df-iota 6495  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fv 6550
This theorem is referenced by:  tz7.48-3  8467
  Copyright terms: Public domain W3C validator