wsuclem - Mathbox for Scott Fenton

	Mathbox for Scott Fenton		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > wsuclem		Structured version Visualization version GIF version

Theorem wsuclem 33819

Description: Lemma for the supremum properties of well-founded successor. (Contributed by Scott Fenton, 15-Jun-2018.) (Revised by AV, 10-Oct-2021.)

**Hypotheses**
Ref	Expression
wsuclem.1	⊢ (𝜑 → 𝑅 We 𝐴)
wsuclem.2	⊢ (𝜑 → 𝑅 Se 𝐴)
wsuclem.3	⊢ (𝜑 → 𝑋 ∈ 𝑉)
wsuclem.4	⊢ (𝜑 → ∃𝑤 ∈ 𝐴 𝑋𝑅𝑤)

**Assertion**
Ref	Expression
wsuclem	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ Pred (^◡𝑅, 𝐴, 𝑋) ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦)))

Distinct variable groups: 𝑥,𝐴,𝑦,𝑧,𝑤 𝜑,𝑥,𝑦 𝑥,𝑅,𝑦,𝑧,𝑤 𝑥,𝑋,𝑦,𝑧,𝑤 Allowed substitution hints: 𝜑(𝑧,𝑤) 𝑉(𝑥,𝑦,𝑧,𝑤)

**Proof of Theorem wsuclem**
Step	Hyp	Ref	Expression
1		wsuclem.1	. . 3 ⊢ (𝜑 → 𝑅 We 𝐴)
2		wsuclem.2	. . 3 ⊢ (𝜑 → 𝑅 Se 𝐴)
3		predss 6210	. . . 4 ⊢ Pred(^◡𝑅, 𝐴, 𝑋) ⊆ 𝐴
4	3	a1i 11	. . 3 ⊢ (𝜑 → Pred(^◡𝑅, 𝐴, 𝑋) ⊆ 𝐴)
5		wsuclem.3	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
6		dfpred3g 6214	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → Pred(^◡𝑅, 𝐴, 𝑋) = {𝑤 ∈ 𝐴 ∣ 𝑤^◡𝑅𝑋})
7	5, 6	syl 17	. . . 4 ⊢ (𝜑 → Pred(^◡𝑅, 𝐴, 𝑋) = {𝑤 ∈ 𝐴 ∣ 𝑤^◡𝑅𝑋})
8	5	elexd 3452	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ V)
9		wsuclem.4	. . . . 5 ⊢ (𝜑 → ∃𝑤 ∈ 𝐴 𝑋𝑅𝑤)
10		rabn0 4319	. . . . . . 7 ⊢ ({𝑤 ∈ 𝐴 ∣ 𝑤^◡𝑅𝑋} ≠ ∅ ↔ ∃𝑤 ∈ 𝐴 𝑤^◡𝑅𝑋)
11		brcnvg 5788	. . . . . . . . 9 ⊢ ((𝑤 ∈ 𝐴 ∧ 𝑋 ∈ V) → (𝑤^◡𝑅𝑋 ↔ 𝑋𝑅𝑤))
12	11	ancoms 459	. . . . . . . 8 ⊢ ((𝑋 ∈ V ∧ 𝑤 ∈ 𝐴) → (𝑤^◡𝑅𝑋 ↔ 𝑋𝑅𝑤))
13	12	rexbidva 3225	. . . . . . 7 ⊢ (𝑋 ∈ V → (∃𝑤 ∈ 𝐴 𝑤^◡𝑅𝑋 ↔ ∃𝑤 ∈ 𝐴 𝑋𝑅𝑤))
14	10, 13	syl5bb 283	. . . . . 6 ⊢ (𝑋 ∈ V → ({𝑤 ∈ 𝐴 ∣ 𝑤^◡𝑅𝑋} ≠ ∅ ↔ ∃𝑤 ∈ 𝐴 𝑋𝑅𝑤))
15	14	biimpar 478	. . . . 5 ⊢ ((𝑋 ∈ V ∧ ∃𝑤 ∈ 𝐴 𝑋𝑅𝑤) → {𝑤 ∈ 𝐴 ∣ 𝑤^◡𝑅𝑋} ≠ ∅)
16	8, 9, 15	syl2anc 584	. . . 4 ⊢ (𝜑 → {𝑤 ∈ 𝐴 ∣ 𝑤^◡𝑅𝑋} ≠ ∅)
17	7, 16	eqnetrd 3011	. . 3 ⊢ (𝜑 → Pred(^◡𝑅, 𝐴, 𝑋) ≠ ∅)
18		tz6.26 6250	. . 3 ⊢ (((𝑅 We 𝐴 ∧ 𝑅 Se 𝐴) ∧ (Pred(^◡𝑅, 𝐴, 𝑋) ⊆ 𝐴 ∧ Pred(^◡𝑅, 𝐴, 𝑋) ≠ ∅)) → ∃𝑥 ∈ Pred (^◡𝑅, 𝐴, 𝑋)Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅)
19	1, 2, 4, 17, 18	syl22anc 836	. 2 ⊢ (𝜑 → ∃𝑥 ∈ Pred (^◡𝑅, 𝐴, 𝑋)Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅)
20		dfpred3g 6214	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → Pred(^◡𝑅, 𝐴, 𝑋) = {𝑦 ∈ 𝐴 ∣ 𝑦^◡𝑅𝑋})
21	5, 20	syl 17	. . . 4 ⊢ (𝜑 → Pred(^◡𝑅, 𝐴, 𝑋) = {𝑦 ∈ 𝐴 ∣ 𝑦^◡𝑅𝑋})
22	21	rexeqdv 3349	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ Pred (^◡𝑅, 𝐴, 𝑋)Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅ ↔ ∃𝑥 ∈ {𝑦 ∈ 𝐴 ∣ 𝑦^◡𝑅𝑋}Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅))
23		breq1 5077	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝑦^◡𝑅𝑋 ↔ 𝑥^◡𝑅𝑋))
24	23	rexrab 3633	. . . 4 ⊢ (∃𝑥 ∈ {𝑦 ∈ 𝐴 ∣ 𝑦^◡𝑅𝑋}Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅ ↔ ∃𝑥 ∈ 𝐴 (𝑥^◡𝑅𝑋 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅))
25		noel 4264	. . . . . . . . . . . 12 ⊢ ¬ 𝑦 ∈ ∅
26		simp2r 1199	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅) ∧ 𝑦 ∈ Pred(^◡𝑅, 𝐴, 𝑋)) → Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅)
27	26	eleq2d 2824	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅) ∧ 𝑦 ∈ Pred(^◡𝑅, 𝐴, 𝑋)) → (𝑦 ∈ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) ↔ 𝑦 ∈ ∅))
28	25, 27	mtbiri 327	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅) ∧ 𝑦 ∈ Pred(^◡𝑅, 𝐴, 𝑋)) → ¬ 𝑦 ∈ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥))
29		vex 3436	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
30	29	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅) ∧ 𝑦 ∈ Pred(^◡𝑅, 𝐴, 𝑋)) → 𝑥 ∈ V)
31		simp3 1137	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅) ∧ 𝑦 ∈ Pred(^◡𝑅, 𝐴, 𝑋)) → 𝑦 ∈ Pred(^◡𝑅, 𝐴, 𝑋))
32		elpredg 6216	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ Pred(^◡𝑅, 𝐴, 𝑋)) → (𝑦 ∈ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) ↔ 𝑦𝑅𝑥))
33	30, 31, 32	syl2anc 584	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅) ∧ 𝑦 ∈ Pred(^◡𝑅, 𝐴, 𝑋)) → (𝑦 ∈ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) ↔ 𝑦𝑅𝑥))
34	28, 33	mtbid 324	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅) ∧ 𝑦 ∈ Pred(^◡𝑅, 𝐴, 𝑋)) → ¬ 𝑦𝑅𝑥)
35	34	3expa 1117	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅)) ∧ 𝑦 ∈ Pred(^◡𝑅, 𝐴, 𝑋)) → ¬ 𝑦𝑅𝑥)
36	35	ralrimiva 3103	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅)) → ∀𝑦 ∈ Pred (^◡𝑅, 𝐴, 𝑋) ¬ 𝑦𝑅𝑥)
37	36	expr 457	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅ → ∀𝑦 ∈ Pred (^◡𝑅, 𝐴, 𝑋) ¬ 𝑦𝑅𝑥))
38		simp1rl 1237	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)) ∧ 𝑦 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → 𝑥 ∈ 𝐴)
39		simp1rr 1238	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)) ∧ 𝑦 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → 𝑥^◡𝑅𝑋)
40	5	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)) → 𝑋 ∈ 𝑉)
41	40	3ad2ant1 1132	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)) ∧ 𝑦 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → 𝑋 ∈ 𝑉)
42	29	elpred 6219	. . . . . . . . . . . . 13 ⊢ (𝑋 ∈ 𝑉 → (𝑥 ∈ Pred(^◡𝑅, 𝐴, 𝑋) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)))
43	41, 42	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)) ∧ 𝑦 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → (𝑥 ∈ Pred(^◡𝑅, 𝐴, 𝑋) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)))
44	38, 39, 43	mpbir2and 710	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)) ∧ 𝑦 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → 𝑥 ∈ Pred(^◡𝑅, 𝐴, 𝑋))
45		simp3 1137	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)) ∧ 𝑦 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → 𝑥𝑅𝑦)
46		breq1 5077	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑥 → (𝑧𝑅𝑦 ↔ 𝑥𝑅𝑦))
47	46	rspcev 3561	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ Pred(^◡𝑅, 𝐴, 𝑋) ∧ 𝑥𝑅𝑦) → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦)
48	44, 45, 47	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)) ∧ 𝑦 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦)
49	48	3expia 1120	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)) ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦))
50	49	ralrimiva 3103	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥^◡𝑅𝑋)) → ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦))
51	50	expr 457	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥^◡𝑅𝑋 → ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦)))
52	37, 51	anim12d 609	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅ ∧ 𝑥^◡𝑅𝑋) → (∀𝑦 ∈ Pred (^◡𝑅, 𝐴, 𝑋) ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦))))
53	52	ancomsd 466	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥^◡𝑅𝑋 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅) → (∀𝑦 ∈ Pred (^◡𝑅, 𝐴, 𝑋) ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦))))
54	53	reximdva 3203	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 (𝑥^◡𝑅𝑋 ∧ Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ Pred (^◡𝑅, 𝐴, 𝑋) ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦))))
55	24, 54	syl5bi 241	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ {𝑦 ∈ 𝐴 ∣ 𝑦^◡𝑅𝑋}Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅ → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ Pred (^◡𝑅, 𝐴, 𝑋) ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦))))
56	22, 55	sylbid 239	. 2 ⊢ (𝜑 → (∃𝑥 ∈ Pred (^◡𝑅, 𝐴, 𝑋)Pred(𝑅, Pred(^◡𝑅, 𝐴, 𝑋), 𝑥) = ∅ → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ Pred (^◡𝑅, 𝐴, 𝑋) ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦))))
57	19, 56	mpd 15	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ Pred (^◡𝑅, 𝐴, 𝑋) ¬ 𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 → ∃𝑧 ∈ Pred (^◡𝑅, 𝐴, 𝑋)𝑧𝑅𝑦)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 {crab 3068 Vcvv 3432 ⊆ wss 3887 ∅c0 4256 class class class wbr 5074 Se wse 5542 We wwe 5543 ^◡ccnv 5588 Predcpred 6201

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-opab 5137 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-cnv 5597 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202

This theorem is referenced by: wsuccl 33821 wsuclb 33822

W3C validator