satfbrsuc - Mathbox for Mario Carneiro

	Mathbox for Mario Carneiro		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > satfbrsuc		Structured version Visualization version GIF version

Theorem satfbrsuc 35664

Description: The binary relation of a satisfaction predicate as function over wff codes at a successor. (Contributed by AV, 13-Oct-2023.)

**Hypotheses**
Ref	Expression
satfbrsuc.s	⊢ 𝑆 = (𝑀 Sat 𝐸)
satfbrsuc.p	⊢ 𝑃 = (𝑆‘𝑁)

**Assertion**
Ref	Expression
satfbrsuc	⊢ (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑁 ∈ ω ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝐴(𝑆‘suc 𝑁)𝐵 ↔ (𝐴𝑃𝐵 ∨ ∃𝑢 ∈ 𝑃 (∃𝑣 ∈ 𝑃 (𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝐴 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})))))

Distinct variable groups: 𝐴,𝑖,𝑢,𝑣 𝐵,𝑖,𝑢,𝑣 𝑓,𝐸,𝑖,𝑢,𝑣,𝑧 𝑓,𝑀,𝑖,𝑢,𝑣,𝑧 𝑢,𝑁,𝑣 𝑣,𝑃 𝑢,𝑆,𝑣 𝑢,𝑉 𝑢,𝑊 Allowed substitution hints: 𝐴(𝑧,𝑓) 𝐵(𝑧,𝑓) 𝑃(𝑧,𝑢,𝑓,𝑖) 𝑆(𝑧,𝑓,𝑖) 𝑁(𝑧,𝑓,𝑖) 𝑉(𝑧,𝑣,𝑓,𝑖) 𝑊(𝑧,𝑣,𝑓,𝑖) 𝑋(𝑧,𝑣,𝑢,𝑓,𝑖) 𝑌(𝑧,𝑣,𝑢,𝑓,𝑖)

Proof of Theorem satfbrsuc Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		satfbrsuc.s	. . . . . 6 ⊢ 𝑆 = (𝑀 Sat 𝐸)
2	1	satfvsuc 35659	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊 ∧ 𝑁 ∈ ω) → (𝑆‘suc 𝑁) = ((𝑆‘𝑁) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))}))
3	2	3expa 1127	. . . 4 ⊢ (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑁 ∈ ω) → (𝑆‘suc 𝑁) = ((𝑆‘𝑁) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))}))
4	3	3adant3 1141	. . 3 ⊢ (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑁 ∈ ω ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝑆‘suc 𝑁) = ((𝑆‘𝑁) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))}))
5	4	breqd 5105	. 2 ⊢ (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑁 ∈ ω ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝐴(𝑆‘suc 𝑁)𝐵 ↔ 𝐴((𝑆‘𝑁) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))})𝐵))
6		brun 5145	. . . 4 ⊢ (𝐴((𝑆‘𝑁) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))})𝐵 ↔ (𝐴(𝑆‘𝑁)𝐵 ∨ 𝐴{⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))}𝐵))
7		satfbrsuc.p	. . . . . . . 8 ⊢ 𝑃 = (𝑆‘𝑁)
8	7	eqcomi 2765	. . . . . . 7 ⊢ (𝑆‘𝑁) = 𝑃
9	8	breqi 5100	. . . . . 6 ⊢ (𝐴(𝑆‘𝑁)𝐵 ↔ 𝐴𝑃𝐵)
10	9	a1i 11	. . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → (𝐴(𝑆‘𝑁)𝐵 ↔ 𝐴𝑃𝐵))
11		eqeq1 2760	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ↔ 𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣))))
12		eqeq1 2760	. . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣))) ↔ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))))
13	11, 12	bi2anan9 646	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ↔ (𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣))))))
14	13	rexbidv 3180	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑣 ∈ 𝑃 (𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ↔ ∃𝑣 ∈ 𝑃 (𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣))))))
15		eqeq1 2760	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ↔ 𝐴 = ∀_𝑔𝑖(1^st ‘𝑢)))
16		eqeq1 2760	. . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)} ↔ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))
17	15, 16	bi2anan9 646	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}) ↔ (𝐴 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})))
18	17	rexbidv 3180	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}) ↔ ∃𝑖 ∈ ω (𝐴 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})))
19	14, 18	orbi12d 927	. . . . . . 7 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((∃𝑣 ∈ 𝑃 (𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})) ↔ (∃𝑣 ∈ 𝑃 (𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝐴 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))))
20	19	rexbidv 3180	. . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑢 ∈ 𝑃 (∃𝑣 ∈ 𝑃 (𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})) ↔ ∃𝑢 ∈ 𝑃 (∃𝑣 ∈ 𝑃 (𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝐴 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))))
21	8	rexeqi 3313	. . . . . . . . 9 ⊢ (∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ↔ ∃𝑣 ∈ 𝑃 (𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))))
22	21	orbi1i 922	. . . . . . . 8 ⊢ ((∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})) ↔ (∃𝑣 ∈ 𝑃 (𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})))
23	8, 22	rexeqbii 3329	. . . . . . 7 ⊢ (∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})) ↔ ∃𝑢 ∈ 𝑃 (∃𝑣 ∈ 𝑃 (𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})))
24	23	opabbii 5161	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ 𝑃 (∃𝑣 ∈ 𝑃 (𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))}
25	20, 24	brabga 5498	. . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → (𝐴{⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))}𝐵 ↔ ∃𝑢 ∈ 𝑃 (∃𝑣 ∈ 𝑃 (𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝐴 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))))
26	10, 25	orbi12d 927	. . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → ((𝐴(𝑆‘𝑁)𝐵 ∨ 𝐴{⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))}𝐵) ↔ (𝐴𝑃𝐵 ∨ ∃𝑢 ∈ 𝑃 (∃𝑣 ∈ 𝑃 (𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝐴 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})))))
27	6, 26	bitrid 285	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) → (𝐴((𝑆‘𝑁) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))})𝐵 ↔ (𝐴𝑃𝐵 ∨ ∃𝑢 ∈ 𝑃 (∃𝑣 ∈ 𝑃 (𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝐴 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})))))
28	27	3ad2ant3 1144	. 2 ⊢ (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑁 ∈ ω ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝐴((𝑆‘𝑁) ∪ {⟨𝑥, 𝑦⟩ ∣ ∃𝑢 ∈ (𝑆‘𝑁)(∃𝑣 ∈ (𝑆‘𝑁)(𝑥 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝑦 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝑥 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝑦 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)}))})𝐵 ↔ (𝐴𝑃𝐵 ∨ ∃𝑢 ∈ 𝑃 (∃𝑣 ∈ 𝑃 (𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝐴 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})))))
29	5, 28	bitrd 281	1 ⊢ (((𝑀 ∈ 𝑉 ∧ 𝐸 ∈ 𝑊) ∧ 𝑁 ∈ ω ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌)) → (𝐴(𝑆‘suc 𝑁)𝐵 ↔ (𝐴𝑃𝐵 ∨ ∃𝑢 ∈ 𝑃 (∃𝑣 ∈ 𝑃 (𝐴 = ((1^st ‘𝑢)⊼_𝑔(1^st ‘𝑣)) ∧ 𝐵 = ((𝑀 ↑_m ω) ∖ ((2^nd ‘𝑢) ∩ (2^nd ‘𝑣)))) ∨ ∃𝑖 ∈ ω (𝐴 = ∀_𝑔𝑖(1^st ‘𝑢) ∧ 𝐵 = {𝑓 ∈ (𝑀 ↑_m ω) ∣ ∀𝑧 ∈ 𝑀 ({⟨𝑖, 𝑧⟩} ∪ (𝑓 ↾ (ω ∖ {𝑖}))) ∈ (2^nd ‘𝑢)})))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 856 ∧ w3a 1095 = wceq 1554 ∈ wcel 2136 ∀wral 3070 ∃wrex 3080 {crab 3408 ∖ cdif 3896 ∪ cun 3897 ∩ cin 3898 {csn 4576 ⟨cop 4582 class class class wbr 5094 {copab 5156 ↾ cres 5642 suc csuc 6337 ‘cfv 6510 (class class class)co 7385 ωcom 7835 1^st c1st 7957 2^nd c2nd 7958 ↑_m cmap 8796 ⊼_𝑔cgna 35632 ∀_𝑔cgol 35633 Sat csat 35634

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-inf2 9586

This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-ral 3071 df-rex 3081 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-2nd 7960 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-sat 35641

This theorem is referenced by: (None)

W3C validator