Theorem frinxp 5734

Description: Intersection of well-founded relation with Cartesian product of its field. (Contributed by Mario Carneiro, 10-Jul-2014.)

Assertion

Ref	Expression
frinxp	⊢ (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)

Proof of Theorem frinxp

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

Step	Hyp	Ref	Expression
1		ssel 3925	. . . . . . . . . . 11 ⊢ (𝑧 ⊆ 𝐴 → (𝑥 ∈ 𝑧 → 𝑥 ∈ 𝐴))
2		ssel 3925	. . . . . . . . . . 11 ⊢ (𝑧 ⊆ 𝐴 → (𝑦 ∈ 𝑧 → 𝑦 ∈ 𝐴))
3	1, 2	anim12d 621	. . . . . . . . . 10 ⊢ (𝑧 ⊆ 𝐴 → ((𝑥 ∈ 𝑧 ∧ 𝑦 ∈ 𝑧) → (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)))
4		brinxp 5730	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
5	4	ancoms 464	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
6	3, 5	syl6 36	. . . . . . . . 9 ⊢ (𝑧 ⊆ 𝐴 → ((𝑥 ∈ 𝑧 ∧ 𝑦 ∈ 𝑧) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
7	6	impl 461	. . . . . . . 8 ⊢ (((𝑧 ⊆ 𝐴 ∧ 𝑥 ∈ 𝑧) ∧ 𝑦 ∈ 𝑧) → (𝑦𝑅𝑥 ↔ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
8	7	notbid 321	. . . . . . 7 ⊢ (((𝑧 ⊆ 𝐴 ∧ 𝑥 ∈ 𝑧) ∧ 𝑦 ∈ 𝑧) → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
9	8	ralbidva 3184	. . . . . 6 ⊢ ((𝑧 ⊆ 𝐴 ∧ 𝑥 ∈ 𝑧) → (∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
10	9	rexbidva 3185	. . . . 5 ⊢ (𝑧 ⊆ 𝐴 → (∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
11	10	adantr 486	. . . 4 ⊢ ((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → (∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
12	11	pm5.74i 274	. . 3 ⊢ (((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥) ↔ ((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
13	12	albii 1852	. 2 ⊢ (∀𝑧((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥) ↔ ∀𝑧((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
14		df-fr 5604	. 2 ⊢ (𝑅 Fr 𝐴 ↔ ∀𝑧((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦𝑅𝑥))
15		df-fr 5604	. 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ↔ ∀𝑧((𝑧 ⊆ 𝐴 ∧ 𝑧 ≠ ∅) → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑧 ¬ 𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
16	13, 14, 15	3bitr4i 306	1 ⊢ (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   ∈ wcel 2145   ≠ wne 2956  ∀wral 3077  ∃wrex 3087   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279   class class class wbr 5103   Fr wfr 5601   × cxp 5649

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 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-fr 5604  df-xp 5657

This theorem is used by:  weinxp  5736