Theorem smoel2 8409

Description: A strictly monotone ordinal function preserves the membership relation. (Contributed by Mario Carneiro, 12-Mar-2013.)

Assertion

Ref	Expression
smoel2	⊢ (((𝐹 Fn 𝐴 ∧ Smo 𝐹) ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)) → (𝐹‘𝐶) ∈ (𝐹‘𝐵))

Proof of Theorem smoel2

Step	Hyp	Ref	Expression
1		fndm 6672	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
2	1	eleq2d 2850	. . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝐵 ∈ dom 𝐹 ↔ 𝐵 ∈ 𝐴))
3	2	anbi1d 643	. . . 4 ⊢ (𝐹 Fn 𝐴 → ((𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵) ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)))
4	3	biimprd 251	. . 3 ⊢ (𝐹 Fn 𝐴 → ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵)))
5		smoel 8406	. . . 4 ⊢ ((Smo 𝐹 ∧ 𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹‘𝐵))
6	5	3expib 1140	. . 3 ⊢ (Smo 𝐹 → ((𝐵 ∈ dom 𝐹 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹‘𝐵)))
7	4, 6	sylan9 517	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ Smo 𝐹) → ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹‘𝐵)))
8	7	imp 412	1 ⊢ (((𝐹 Fn 𝐴 ∧ Smo 𝐹) ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)) → (𝐹‘𝐶) ∈ (𝐹‘𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  dom cdm 5658   Fn wfn 6561  ‘cfv 6566  Smo wsmo 8391

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-tr 5219  df-ord 6391  df-iota 6520  df-fn 6569  df-fv 6574  df-smo 8392

This theorem is used by:  smo11  8410  smoord  8411  smogt  8413  cofsmo  10386