Theorem isarchi 33566

Description: Express the predicate "𝑊 is Archimedean ". (Contributed by Thierry Arnoux, 30-Jan-2018.)

Hypotheses

Ref	Expression
isarchi.b	⊢ 𝐵 = (Base‘𝑊)
isarchi.0	⊢ 0 = (0g‘𝑊)
isarchi.i	⊢ < = (⋘‘𝑊)

Assertion

Ref	Expression
isarchi	⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝑊,𝑦

Allowed substitution hints:   < (𝑥, 𝑦)   𝑉(𝑥, 𝑦)   0 (𝑥, 𝑦)

Proof of Theorem isarchi

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveqeq2 6894	. . 3 ⊢ (𝑤 = 𝑊 → ((⋘‘𝑤) = ∅ ↔ (⋘‘𝑊) = ∅))
2		df-archi 33563	. . 3 ⊢ Archi = {𝑤 ∣ (⋘‘𝑤) = ∅}
3	1, 2	elab2g 3641	. 2 ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ (⋘‘𝑊) = ∅))
4		isarchi.b	. . . 4 ⊢ 𝐵 = (Base‘𝑊)
5	4	inftmrel 33564	. . 3 ⊢ (𝑊 ∈ 𝑉 → (⋘‘𝑊) ⊆ (𝐵 × 𝐵))
6		ss0b 4358	. . . . 5 ⊢ ((⋘‘𝑊) ⊆ ∅ ↔ (⋘‘𝑊) = ∅)
7		ssrel2 5773	. . . . 5 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) ⊆ ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅)))
8	6, 7	bitr3id 288	. . . 4 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅)))
9		noel 4291	. . . . . . . 8 ⊢ ¬ ⟨𝑥, 𝑦⟩ ∈ ∅
10	9	nbn 375	. . . . . . 7 ⊢ (¬ ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅))
11		isarchi.i	. . . . . . . . 9 ⊢ < = (⋘‘𝑊)
12	11	breqi 5117	. . . . . . . 8 ⊢ (𝑥 < 𝑦 ↔ 𝑥(⋘‘𝑊)𝑦)
13		df-br 5112	. . . . . . . 8 ⊢ (𝑥(⋘‘𝑊)𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))
14	12, 13	bitri 278	. . . . . . 7 ⊢ (𝑥 < 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))
15	10, 14	xchnxbir 336	. . . . . 6 ⊢ (¬ 𝑥 < 𝑦 ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅))
16	9	pm2.21i 120	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ ∅ → ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))
17		dfbi2 480	. . . . . . 7 ⊢ ((⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅) ↔ ((⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅) ∧ (⟨𝑥, 𝑦⟩ ∈ ∅ → ⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊))))
18	16, 17	mpbiran2 723	. . . . . 6 ⊢ ((⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) ↔ ⟨𝑥, 𝑦⟩ ∈ ∅) ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅))
19	15, 18	bitri 278	. . . . 5 ⊢ (¬ 𝑥 < 𝑦 ↔ (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅))
20	19	2ralbii 3142	. . . 4 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ (⋘‘𝑊) → ⟨𝑥, 𝑦⟩ ∈ ∅))
21	8, 20	bitr4di 292	. . 3 ⊢ ((⋘‘𝑊) ⊆ (𝐵 × 𝐵) → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))
22	5, 21	syl 18	. 2 ⊢ (𝑊 ∈ 𝑉 → ((⋘‘𝑊) = ∅ ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))
23	3, 22	bitrd 282	1 ⊢ (𝑊 ∈ 𝑉 → (𝑊 ∈ Archi ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑥 < 𝑦))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2146  ∀wral 3081   ⊆ wss 3906  ∅c0 4286  ⟨cop 4597   class class class wbr 5111   × cxp 5661  ‘cfv 6540  Basecbs 17291  0_gc0g 17514  ⋘cinftm 33560  Archicarchi 33561

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742

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-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7422  df-inftm 33562  df-archi 33563

This theorem is used by:  xrnarchi  33568  isarchi2  33569