Theorem isinftm 32358

Description: Express 𝑥 is infinitesimal with respect to 𝑦 for a structure 𝑊. (Contributed by Thierry Arnoux, 30-Jan-2018.)

Hypotheses

Ref	Expression
inftm.b	⊢ 𝐵 = (Base‘𝑊)
inftm.0	⊢ 0 = (0g‘𝑊)
inftm.x	⊢ · = (.g‘𝑊)
inftm.l	⊢ < = (lt‘𝑊)

Assertion

Ref	Expression
isinftm	⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(⋘‘𝑊)𝑌 ↔ ( 0 < 𝑋 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑋) < 𝑌)))

Distinct variable groups:   𝑛,𝑊   𝑛,𝑋   𝑛,𝑌

Allowed substitution hints:   𝐵(𝑛)   < (𝑛)   · (𝑛)   𝑉(𝑛)   0 (𝑛)

Proof of Theorem isinftm

Dummy variables 𝑥 𝑤 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2822	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝐵 ↔ 𝑋 ∈ 𝐵))
2		eleq1 2822	. . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑦 ∈ 𝐵 ↔ 𝑌 ∈ 𝐵))
3	1, 2	bi2anan9 638	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)))
4		simpl 484	. . . . . . 7 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝑥 = 𝑋)
5	4	breq2d 5161	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ( 0 < 𝑥 ↔ 0 < 𝑋))
6	4	oveq2d 7425	. . . . . . . 8 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑛 · 𝑥) = (𝑛 · 𝑋))
7		simpr 486	. . . . . . . 8 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌)
8	6, 7	breq12d 5162	. . . . . . 7 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝑛 · 𝑥) < 𝑦 ↔ (𝑛 · 𝑋) < 𝑌))
9	8	ralbidv 3178	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦 ↔ ∀𝑛 ∈ ℕ (𝑛 · 𝑋) < 𝑌))
10	5, 9	anbi12d 632	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦) ↔ ( 0 < 𝑋 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑋) < 𝑌)))
11	3, 10	anbi12d 632	. . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦)) ↔ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ( 0 < 𝑋 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑋) < 𝑌))))
12		eqid 2733	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))}
13	11, 12	brabga 5535	. . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋{⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))}𝑌 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ( 0 < 𝑋 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑋) < 𝑌))))
14	13	3adant1 1131	. 2 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋{⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))}𝑌 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ( 0 < 𝑋 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑋) < 𝑌))))
15		elex 3493	. . . . 5 ⊢ (𝑊 ∈ 𝑉 → 𝑊 ∈ V)
16	15	3ad2ant1 1134	. . . 4 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑊 ∈ V)
17		fveq2 6892	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
18		inftm.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑊)
19	17, 18	eqtr4di 2791	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (Base‘𝑤) = 𝐵)
20	19	eleq2d 2820	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑥 ∈ (Base‘𝑤) ↔ 𝑥 ∈ 𝐵))
21	19	eleq2d 2820	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (𝑦 ∈ (Base‘𝑤) ↔ 𝑦 ∈ 𝐵))
22	20, 21	anbi12d 632	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((𝑥 ∈ (Base‘𝑤) ∧ 𝑦 ∈ (Base‘𝑤)) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)))
23		fveq2 6892	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = (0g‘𝑊))
24		inftm.0	. . . . . . . . . 10 ⊢ 0 = (0g‘𝑊)
25	23, 24	eqtr4di 2791	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (0g‘𝑤) = 0 )
26		fveq2 6892	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (lt‘𝑤) = (lt‘𝑊))
27		inftm.l	. . . . . . . . . 10 ⊢ < = (lt‘𝑊)
28	26, 27	eqtr4di 2791	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (lt‘𝑤) = < )
29		eqidd 2734	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → 𝑥 = 𝑥)
30	25, 28, 29	breq123d 5163	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → ((0g‘𝑤)(lt‘𝑤)𝑥 ↔ 0 < 𝑥))
31		fveq2 6892	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑊 → (.g‘𝑤) = (.g‘𝑊))
32		inftm.x	. . . . . . . . . . . 12 ⊢ · = (.g‘𝑊)
33	31, 32	eqtr4di 2791	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑊 → (.g‘𝑤) = · )
34	33	oveqd 7426	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → (𝑛(.g‘𝑤)𝑥) = (𝑛 · 𝑥))
35		eqidd 2734	. . . . . . . . . 10 ⊢ (𝑤 = 𝑊 → 𝑦 = 𝑦)
36	34, 28, 35	breq123d 5163	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → ((𝑛(.g‘𝑤)𝑥)(lt‘𝑤)𝑦 ↔ (𝑛 · 𝑥) < 𝑦))
37	36	ralbidv 3178	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (∀𝑛 ∈ ℕ (𝑛(.g‘𝑤)𝑥)(lt‘𝑤)𝑦 ↔ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))
38	30, 37	anbi12d 632	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (((0g‘𝑤)(lt‘𝑤)𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛(.g‘𝑤)𝑥)(lt‘𝑤)𝑦) ↔ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦)))
39	22, 38	anbi12d 632	. . . . . 6 ⊢ (𝑤 = 𝑊 → (((𝑥 ∈ (Base‘𝑤) ∧ 𝑦 ∈ (Base‘𝑤)) ∧ ((0g‘𝑤)(lt‘𝑤)𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛(.g‘𝑤)𝑥)(lt‘𝑤)𝑦)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))))
40	39	opabbidv 5215	. . . . 5 ⊢ (𝑤 = 𝑊 → {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑤) ∧ 𝑦 ∈ (Base‘𝑤)) ∧ ((0g‘𝑤)(lt‘𝑤)𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛(.g‘𝑤)𝑥)(lt‘𝑤)𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))})
41		df-inftm 32355	. . . . 5 ⊢ ⋘ = (𝑤 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (Base‘𝑤) ∧ 𝑦 ∈ (Base‘𝑤)) ∧ ((0g‘𝑤)(lt‘𝑤)𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛(.g‘𝑤)𝑥)(lt‘𝑤)𝑦))})
42	18	fvexi 6906	. . . . . . 7 ⊢ 𝐵 ∈ V
43	42, 42	xpex 7740	. . . . . 6 ⊢ (𝐵 × 𝐵) ∈ V
44		opabssxp 5769	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))} ⊆ (𝐵 × 𝐵)
45	43, 44	ssexi 5323	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))} ∈ V
46	40, 41, 45	fvmpt 6999	. . . 4 ⊢ (𝑊 ∈ V → (⋘‘𝑊) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))})
47	16, 46	syl 17	. . 3 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (⋘‘𝑊) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))})
48	47	breqd 5160	. 2 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(⋘‘𝑊)𝑌 ↔ 𝑋{⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ( 0 < 𝑥 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑥) < 𝑦))}𝑌))
49		3simpc 1151	. . 3 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵))
50	49	biantrurd 534	. 2 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( 0 < 𝑋 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑋) < 𝑌) ↔ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ( 0 < 𝑋 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑋) < 𝑌))))
51	14, 48, 50	3bitr4d 311	1 ⊢ ((𝑊 ∈ 𝑉 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(⋘‘𝑊)𝑌 ↔ ( 0 < 𝑋 ∧ ∀𝑛 ∈ ℕ (𝑛 · 𝑋) < 𝑌)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 397   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107  ∀wral 3062  Vcvv 3475   class class class wbr 5149  {copab 5211   × cxp 5675  ‘cfv 6544  (class class class)co 7409  ℕcn 12212  Basecbs 17144  0_gc0g 17385  ltcplt 18261  ._gcmg 18950  ⋘cinftm 32353

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-iota 6496  df-fun 6546  df-fv 6552  df-ov 7412  df-inftm 32355

This theorem is referenced by:  pnfinf  32360  isarchi2  32362