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

Theorem tz7.48-1 8418
Description: Proposition 7.48(1) of [TakeutiZaring] p. 51. (Contributed by NM, 9-Feb-1997.)
Hypothesis
Ref Expression
tz7.48.1 𝐹 Fn On
Assertion
Ref Expression
tz7.48-1 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ran 𝐹𝐴)
Distinct variable groups:   𝑥,𝐹   𝑥,𝐴

Proof of Theorem tz7.48-1
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 vex 3461 . . . . 5 𝑦 ∈ V
21elrn2 5873 . . . 4 (𝑦 ∈ ran 𝐹 ↔ ∃𝑥𝑥, 𝑦⟩ ∈ 𝐹)
3 vex 3461 . . . . . . . . 9 𝑥 ∈ V
43, 1opeldm 5888 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ dom 𝐹)
5 tz7.48.1 . . . . . . . . 9 𝐹 Fn On
65fndmi 6629 . . . . . . . 8 dom 𝐹 = On
74, 6eleqtrdi 2875 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ On)
87ancri 558 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
9 fnopfvb 6922 . . . . . . . 8 ((𝐹 Fn On ∧ 𝑥 ∈ On) → ((𝐹𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
105, 9mpan 702 . . . . . . 7 (𝑥 ∈ On → ((𝐹𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
1110pm5.32i 584 . . . . . 6 ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) ↔ (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
128, 11sylibr 237 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
1312eximi 1858 . . . 4 (∃𝑥𝑥, 𝑦⟩ ∈ 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
142, 13sylbi 220 . . 3 (𝑦 ∈ ran 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
15 nfra1 3289 . . . 4 𝑥𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))
16 nfv 1937 . . . 4 𝑥 𝑦𝐴
17 rsp 3253 . . . . 5 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))))
18 eldifi 4087 . . . . . . . 8 ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝐹𝑥) ∈ 𝐴)
19 eleq1 2853 . . . . . . . 8 ((𝐹𝑥) = 𝑦 → ((𝐹𝑥) ∈ 𝐴𝑦𝐴))
2018, 19syl5ibcom 248 . . . . . . 7 ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ((𝐹𝑥) = 𝑦𝑦𝐴))
2120imim2i 17 . . . . . 6 ((𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → (𝑥 ∈ On → ((𝐹𝑥) = 𝑦𝑦𝐴)))
2221impd 415 . . . . 5 ((𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2317, 22syl 18 . . . 4 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2415, 16, 23exlimd 2256 . . 3 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2514, 24syl5 35 . 2 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝑦 ∈ ran 𝐹𝑦𝐴))
2625ssrdv 3945 1 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ran 𝐹𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1563  wex 1802  wcel 2145  wral 3079  cdif 3904  wss 3907  cop 4591  dom cdm 5652  ran crn 5653  cima 5655  Oncon0 6350   Fn wfn 6520  cfv 6525
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-iota 6481  df-fun 6527  df-fn 6528  df-fv 6533
This theorem is referenced by:  tz7.48-3  8419
  Copyright terms: Public domain W3C validator