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 8429
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 3457 . . . . 5 𝑦 ∈ V
21elrn2 5882 . . . 4 (𝑦 ∈ ran 𝐹 ↔ ∃𝑥𝑥, 𝑦⟩ ∈ 𝐹)
3 vex 3457 . . . . . . . . 9 𝑥 ∈ V
43, 1opeldm 5897 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ dom 𝐹)
5 tz7.48.1 . . . . . . . . 9 𝐹 Fn On
65fndmi 6639 . . . . . . . 8 dom 𝐹 = On
74, 6eleqtrdi 2871 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ On)
87ancri 558 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
9 fnopfvb 6932 . . . . . . . 8 ((𝐹 Fn On ∧ 𝑥 ∈ On) → ((𝐹𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
105, 9mpan 702 . . . . . . 7 (𝑥 ∈ On → ((𝐹𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
1110pm5.32i 584 . . . . . 6 ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) ↔ (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
128, 11sylibr 237 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
1312eximi 1863 . . . 4 (∃𝑥𝑥, 𝑦⟩ ∈ 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
142, 13sylbi 220 . . 3 (𝑦 ∈ ran 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
15 nfra1 3287 . . . 4 𝑥𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))
16 nfv 1942 . . . 4 𝑥 𝑦𝐴
17 rsp 3251 . . . . 5 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))))
18 eldifi 4084 . . . . . . . 8 ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝐹𝑥) ∈ 𝐴)
19 eleq1 2849 . . . . . . . 8 ((𝐹𝑥) = 𝑦 → ((𝐹𝑥) ∈ 𝐴𝑦𝐴))
2018, 19syl5ibcom 248 . . . . . . 7 ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ((𝐹𝑥) = 𝑦𝑦𝐴))
2120imim2i 17 . . . . . 6 ((𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → (𝑥 ∈ On → ((𝐹𝑥) = 𝑦𝑦𝐴)))
2221impd 415 . . . . 5 ((𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2317, 22syl 18 . . . 4 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2415, 16, 23exlimd 2252 . . 3 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2514, 24syl5 35 . 2 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝑦 ∈ ran 𝐹𝑦𝐴))
2625ssrdv 3942 1 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ran 𝐹𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1568  wex 1807  wcel 2141  wral 3077  cdif 3901  wss 3904  cop 4594  dom cdm 5661  ran crn 5662  cima 5664  Oncon0 6360   Fn wfn 6531  cfv 6536
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-12 2211  ax-ext 2733  ax-sep 5256  ax-nul 5268  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3415  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-fv 6544
This theorem is referenced by:  tz7.48-3  8430
  Copyright terms: Public domain W3C validator