Theorem nnwofdc 12608

Description: Well-ordering principle: any inhabited decidable set of positive integers has a least element. This version allows 𝑥 and 𝑦 to be present in 𝐴 as long as they are effectively not free. (Contributed by NM, 17-Aug-2001.) (Revised by Mario Carneiro, 15-Oct-2016.)

Hypotheses

Ref	Expression
nnwof.1	⊢ Ⅎ𝑥𝐴
nnwof.2	⊢ Ⅎ𝑦𝐴

Assertion

Ref	Expression
nnwofdc	⊢ ((𝐴 ⊆ ℕ ∧ ∃𝑧 𝑧 ∈ 𝐴 ∧ ∀𝑗 ∈ ℕ DECID 𝑗 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦)

Distinct variable groups:   𝐴,𝑗,𝑧   𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦)

Proof of Theorem nnwofdc

Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nnwodc 12606	. 2 ⊢ ((𝐴 ⊆ ℕ ∧ ∃𝑧 𝑧 ∈ 𝐴 ∧ ∀𝑗 ∈ ℕ DECID 𝑗 ∈ 𝐴) → ∃𝑤 ∈ 𝐴 ∀𝑣 ∈ 𝐴 𝑤 ≤ 𝑣)
2		nfcv 2374	. . 3 ⊢ Ⅎ𝑤𝐴
3		nnwof.1	. . 3 ⊢ Ⅎ𝑥𝐴
4		nfv 1576	. . . 4 ⊢ Ⅎ𝑥 𝑤 ≤ 𝑣
5	3, 4	nfralw 2569	. . 3 ⊢ Ⅎ𝑥∀𝑣 ∈ 𝐴 𝑤 ≤ 𝑣
6		nfv 1576	. . 3 ⊢ Ⅎ𝑤∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦
7		breq1 4091	. . . . 5 ⊢ (𝑤 = 𝑥 → (𝑤 ≤ 𝑣 ↔ 𝑥 ≤ 𝑣))
8	7	ralbidv 2532	. . . 4 ⊢ (𝑤 = 𝑥 → (∀𝑣 ∈ 𝐴 𝑤 ≤ 𝑣 ↔ ∀𝑣 ∈ 𝐴 𝑥 ≤ 𝑣))
9		nfcv 2374	. . . . 5 ⊢ Ⅎ𝑣𝐴
10		nnwof.2	. . . . 5 ⊢ Ⅎ𝑦𝐴
11		nfv 1576	. . . . 5 ⊢ Ⅎ𝑦 𝑥 ≤ 𝑣
12		nfv 1576	. . . . 5 ⊢ Ⅎ𝑣 𝑥 ≤ 𝑦
13		breq2 4092	. . . . 5 ⊢ (𝑣 = 𝑦 → (𝑥 ≤ 𝑣 ↔ 𝑥 ≤ 𝑦))
14	9, 10, 11, 12, 13	cbvralfw 2756	. . . 4 ⊢ (∀𝑣 ∈ 𝐴 𝑥 ≤ 𝑣 ↔ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦)
15	8, 14	bitrdi 196	. . 3 ⊢ (𝑤 = 𝑥 → (∀𝑣 ∈ 𝐴 𝑤 ≤ 𝑣 ↔ ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦))
16	2, 3, 5, 6, 15	cbvrexfw 2757	. 2 ⊢ (∃𝑤 ∈ 𝐴 ∀𝑣 ∈ 𝐴 𝑤 ≤ 𝑣 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦)
17	1, 16	sylib 122	1 ⊢ ((𝐴 ⊆ ℕ ∧ ∃𝑧 𝑧 ∈ 𝐴 ∧ ∀𝑗 ∈ ℕ DECID 𝑗 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 𝑥 ≤ 𝑦)

Syntax hints:   → wi 4  DECID wdc 841   ∧ w3a 1004  ∃wex 1540   ∈ wcel 2202  Ⅎwnfc 2361  ∀wral 2510  ∃wrex 2511   ⊆ wss 3200   class class class wbr 4088   ≤ cle 8214  ℕcn 9142

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-distr 8135  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142  ax-pre-ltirr 8143  ax-pre-ltwlin 8144  ax-pre-lttrn 8145  ax-pre-apti 8146  ax-pre-ltadd 8147

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-po 4393  df-iso 4394  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-isom 5335  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-sup 7182  df-inf 7183  df-pnf 8215  df-mnf 8216  df-xr 8217  df-ltxr 8218  df-le 8219  df-sub 8351  df-neg 8352  df-inn 9143  df-n0 9402  df-z 9479  df-uz 9755  df-fz 10243  df-fzo 10377

This theorem is referenced by:  nnwosdc  12609